./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/underapprox_2-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/underapprox_2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c187a61b21cc0091fb22a1c4e23554540f928674895dd149d9c60db42e5420c7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:02:14,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:02:14,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:02:14,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:02:14,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:02:14,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:02:14,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:02:14,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:02:14,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:02:14,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:02:14,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:02:14,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:02:14,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:02:14,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:02:14,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:02:14,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:02:14,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:02:14,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:02:14,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:02:14,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:02:14,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:02:14,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:02:14,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:02:14,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:02:14,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:02:14,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:02:14,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:02:14,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:02:14,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:02:14,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:02:14,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:02:14,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:02:14,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:02:14,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:02:14,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:02:14,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:02:14,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:02:14,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:02:14,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:02:14,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:02:14,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:02:14,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:02:14,948 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:02:14,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:02:14,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:02:14,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:02:14,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:02:14,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:02:14,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:02:14,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:02:14,950 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:02:14,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:02:14,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:02:14,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:02:14,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:02:14,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:02:14,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:02:14,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:02:14,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:02:14,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:02:14,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:02:14,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:02:14,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:02:14,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:02:14,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:02:14,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:02:14,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:14,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:02:14,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:02:14,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:02:14,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:02:14,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:02:14,954 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:02:14,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:02:14,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:02:14,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c187a61b21cc0091fb22a1c4e23554540f928674895dd149d9c60db42e5420c7 [2022-02-20 17:02:15,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:02:15,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:02:15,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:02:15,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:02:15,150 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:02:15,150 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/underapprox_2-2.c [2022-02-20 17:02:15,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6865d15/d904d25dc3c045c582f53aa606d9508a/FLAG5e3c2395f [2022-02-20 17:02:15,574 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:02:15,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/underapprox_2-2.c [2022-02-20 17:02:15,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6865d15/d904d25dc3c045c582f53aa606d9508a/FLAG5e3c2395f [2022-02-20 17:02:16,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6865d15/d904d25dc3c045c582f53aa606d9508a [2022-02-20 17:02:16,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:02:16,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:02:16,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:16,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:02:16,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:02:16,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600f492f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16, skipping insertion in model container [2022-02-20 17:02:16,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:02:16,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:02:16,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/underapprox_2-2.c[327,340] [2022-02-20 17:02:16,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:16,172 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:02:16,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/underapprox_2-2.c[327,340] [2022-02-20 17:02:16,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:16,196 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:02:16,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16 WrapperNode [2022-02-20 17:02:16,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:16,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:16,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:02:16,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:02:16,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,217 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-02-20 17:02:16,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:16,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:02:16,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:02:16,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:02:16,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:02:16,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:02:16,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:02:16,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:02:16,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (1/1) ... [2022-02-20 17:02:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:16,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:16,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:02:16,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:02:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:02:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:02:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:02:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:02:16,327 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:02:16,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:02:16,387 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:02:16,391 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:02:16,391 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:02:16,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:16 BoogieIcfgContainer [2022-02-20 17:02:16,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:02:16,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:02:16,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:02:16,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:02:16,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:02:16" (1/3) ... [2022-02-20 17:02:16,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d364e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:16, skipping insertion in model container [2022-02-20 17:02:16,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:16" (2/3) ... [2022-02-20 17:02:16,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d364e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:16, skipping insertion in model container [2022-02-20 17:02:16,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:16" (3/3) ... [2022-02-20 17:02:16,398 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_2-2.c [2022-02-20 17:02:16,401 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:02:16,401 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:02:16,429 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:02:16,438 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:02:16,438 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:02:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:02:16,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:16,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:02:16,469 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-02-20 17:02:16,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:16,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084331533] [2022-02-20 17:02:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:16,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:16,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {14#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {14#true} is VALID [2022-02-20 17:02:16,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {14#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := 0;main_~y~0#1 := 1; {16#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:02:16,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 % 4294967296 < 6); {15#false} is VALID [2022-02-20 17:02:16,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {15#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 6 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {15#false} is VALID [2022-02-20 17:02:16,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {15#false} assume 0 == __VERIFIER_assert_~cond#1; {15#false} is VALID [2022-02-20 17:02:16,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {15#false} assume !false; {15#false} is VALID [2022-02-20 17:02:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:16,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:16,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084331533] [2022-02-20 17:02:16,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084331533] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:16,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:16,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:02:16,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288316419] [2022-02-20 17:02:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:16,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 17:02:16,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:16,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:16,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:02:16,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:02:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:02:16,793 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:16,845 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-20 17:02:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:02:16,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 17:02:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 17:02:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 17:02:16,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-20 17:02:16,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:16,889 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:02:16,890 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 17:02:16,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:02:16,898 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:16,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 17:02:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 17:02:16,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:16,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,920 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,921 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:16,923 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:02:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:02:16,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:16,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:16,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2022-02-20 17:02:16,924 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2022-02-20 17:02:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:16,925 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:02:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:02:16,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:16,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:16,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:16,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 17:02:16,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-20 17:02:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:16,933 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 17:02:16,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:02:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:02:16,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:16,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:16,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:02:16,935 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-02-20 17:02:16,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:16,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751485283] [2022-02-20 17:02:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:17,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {69#true} is VALID [2022-02-20 17:02:17,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := 0;main_~y~0#1 := 1; {71#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:02:17,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {71#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {72#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:02:17,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {72#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 1))} assume !(main_~x~0#1 % 4294967296 < 6); {70#false} is VALID [2022-02-20 17:02:17,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 6 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {70#false} is VALID [2022-02-20 17:02:17,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {70#false} assume 0 == __VERIFIER_assert_~cond#1; {70#false} is VALID [2022-02-20 17:02:17,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {70#false} assume !false; {70#false} is VALID [2022-02-20 17:02:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:17,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:17,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751485283] [2022-02-20 17:02:17,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751485283] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:02:17,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575171643] [2022-02-20 17:02:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:17,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:17,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:17,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:02:17,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:02:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:17,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:02:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:17,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:02:17,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {69#true} is VALID [2022-02-20 17:02:17,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := 0;main_~y~0#1 := 1; {71#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:02:17,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {71#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {82#(= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0)} is VALID [2022-02-20 17:02:17,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#(= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0)} assume !(main_~x~0#1 % 4294967296 < 6); {70#false} is VALID [2022-02-20 17:02:17,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 6 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {70#false} is VALID [2022-02-20 17:02:17,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {70#false} assume 0 == __VERIFIER_assert_~cond#1; {70#false} is VALID [2022-02-20 17:02:17,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {70#false} assume !false; {70#false} is VALID [2022-02-20 17:02:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:17,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:02:17,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {70#false} assume !false; {70#false} is VALID [2022-02-20 17:02:17,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {70#false} assume 0 == __VERIFIER_assert_~cond#1; {70#false} is VALID [2022-02-20 17:02:17,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 6 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {70#false} is VALID [2022-02-20 17:02:17,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {104#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 6)} assume !(main_~x~0#1 % 4294967296 < 6); {70#false} is VALID [2022-02-20 17:02:17,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 6)} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {104#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 6)} is VALID [2022-02-20 17:02:17,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := 0;main_~y~0#1 := 1; {108#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 6)} is VALID [2022-02-20 17:02:17,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {69#true} is VALID [2022-02-20 17:02:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:17,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575171643] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:02:17,194 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:02:17,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 17:02:17,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591788875] [2022-02-20 17:02:17,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:02:17,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:02:17,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:17,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:17,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:02:17,203 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:02:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:17,204 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:17,268 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:02:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:17,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:02:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-02-20 17:02:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-02-20 17:02:17,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-02-20 17:02:17,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:17,284 INFO L225 Difference]: With dead ends: 15 [2022-02-20 17:02:17,285 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 17:02:17,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:17,286 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:17,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 17:02:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 17:02:17,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:17,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,291 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,291 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:17,291 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 17:02:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 17:02:17,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:17,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:17,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 17:02:17,292 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 17:02:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:17,293 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 17:02:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 17:02:17,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:17,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:17,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:17,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 17:02:17,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-02-20 17:02:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:17,294 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 17:02:17,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 17:02:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:02:17,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:17,295 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:17,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:02:17,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:17,500 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-02-20 17:02:17,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:17,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250572768] [2022-02-20 17:02:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:17,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:17,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {174#true} is VALID [2022-02-20 17:02:17,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := 0;main_~y~0#1 := 1; {176#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:02:17,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {177#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:02:17,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {178#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:02:17,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {178#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {179#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:02:17,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {180#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:02:17,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 4))} assume !(main_~x~0#1 % 4294967296 < 6); {175#false} is VALID [2022-02-20 17:02:17,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 6 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {175#false} is VALID [2022-02-20 17:02:17,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 17:02:17,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 17:02:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:17,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:17,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250572768] [2022-02-20 17:02:17,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250572768] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:02:17,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785992511] [2022-02-20 17:02:17,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:02:17,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:17,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:17,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:02:17,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:02:17,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:02:17,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:02:17,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:02:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:17,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:02:17,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {174#true} is VALID [2022-02-20 17:02:17,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := 0;main_~y~0#1 := 1; {176#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:02:17,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {177#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:02:17,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {178#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:02:17,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {178#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {179#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:02:17,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {199#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:02:17,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 < 6); {175#false} is VALID [2022-02-20 17:02:17,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 6 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {175#false} is VALID [2022-02-20 17:02:17,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#false} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 17:02:17,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 17:02:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:17,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:02:17,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-02-20 17:02:17,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(not (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {175#false} is VALID [2022-02-20 17:02:17,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#(= 6 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 6 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {215#(not (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:02:17,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(or (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 6) (= 6 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)))} assume !(main_~x~0#1 % 4294967296 < 6); {219#(= 6 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))} is VALID [2022-02-20 17:02:17,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 6) (= 6 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {223#(or (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 6) (= 6 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)))} is VALID [2022-02-20 17:02:17,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {231#(or (= (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 6) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 6))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {227#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 6) (= 6 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296)))} is VALID [2022-02-20 17:02:17,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {235#(or (= 6 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 6))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {231#(or (= (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 6) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 6))} is VALID [2022-02-20 17:02:17,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 6) (= 6 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < 6);main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_~y~0#1 := 2 * main_~y~0#1; {235#(or (= 6 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 6))} is VALID [2022-02-20 17:02:17,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := 0;main_~y~0#1 := 1; {239#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 6) (= 6 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)))} is VALID [2022-02-20 17:02:17,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {174#true} is VALID [2022-02-20 17:02:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:17,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785992511] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:02:17,982 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:02:17,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 15 [2022-02-20 17:02:17,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890254877] [2022-02-20 17:02:17,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:02:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:02:17,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:17,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:18,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:02:18,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:18,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:02:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:02:18,004 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:18,159 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:02:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:02:18,159 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:02:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2022-02-20 17:02:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2022-02-20 17:02:18,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 17 transitions. [2022-02-20 17:02:18,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:18,174 INFO L225 Difference]: With dead ends: 15 [2022-02-20 17:02:18,174 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:02:18,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:02:18,176 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:18,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:02:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:02:18,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:18,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,177 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,177 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:18,177 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:18,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:18,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:18,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:02:18,177 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:02:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:18,177 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:18,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:18,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:18,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:18,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:02:18,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2022-02-20 17:02:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:18,178 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:02:18,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:02:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:18,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:18,180 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:02:18,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:02:18,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:02:18,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:02:18,417 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L854 garLoopResultBuilder]: At program point L16-2(lines 16 19) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))) (or (< .cse0 6) (= 6 .cse0))) [2022-02-20 17:02:18,418 INFO L858 garLoopResultBuilder]: For program point L16-3(lines 16 19) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 22) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:02:18,418 INFO L861 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-02-20 17:02:18,420 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1] [2022-02-20 17:02:18,421 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:02:18,423 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:02:18,423 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:02:18,423 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 17:02:18,423 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 17:02:18,437 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 17:02:18,437 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:02:18,437 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:02:18,437 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:02:18,437 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:02:18,437 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:02:18,437 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:02:18,437 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:02:18,437 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:02:18,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:02:18 BoogieIcfgContainer [2022-02-20 17:02:18,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:02:18,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:02:18,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:02:18,443 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:02:18,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:16" (3/4) ... [2022-02-20 17:02:18,446 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:02:18,451 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 17:02:18,451 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:02:18,451 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:02:18,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:02:18,468 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:02:18,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:02:18,469 INFO L158 Benchmark]: Toolchain (without parser) took 2455.75ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 58.7MB in the beginning and 74.4MB in the end (delta: -15.7MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2022-02-20 17:02:18,469 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:02:18,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.75ms. Allocated memory is still 90.2MB. Free memory was 58.5MB in the beginning and 66.9MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:02:18,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.66ms. Allocated memory is still 90.2MB. Free memory was 66.9MB in the beginning and 65.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:02:18,470 INFO L158 Benchmark]: Boogie Preprocessor took 11.33ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 64.5MB in the end (delta: 697.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:02:18,470 INFO L158 Benchmark]: RCFGBuilder took 162.92ms. Allocated memory is still 90.2MB. Free memory was 64.5MB in the beginning and 55.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:02:18,471 INFO L158 Benchmark]: TraceAbstraction took 2049.20ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.1MB in the beginning and 76.9MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:02:18,471 INFO L158 Benchmark]: Witness Printer took 25.37ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 74.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:02:18,472 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.75ms. Allocated memory is still 90.2MB. Free memory was 58.5MB in the beginning and 66.9MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.66ms. Allocated memory is still 90.2MB. Free memory was 66.9MB in the beginning and 65.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.33ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 64.5MB in the end (delta: 697.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 162.92ms. Allocated memory is still 90.2MB. Free memory was 64.5MB in the beginning and 55.4MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2049.20ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.1MB in the beginning and 76.9MB in the end (delta: -21.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 25.37ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 74.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 18 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 9 NumberOfFragments, 12 HoareAnnotationTreeSize, 2 FomulaSimplifications, 40 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 13 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 211 SizeOfPredicates, 1 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: x % 4294967296 < 6 || 6 == x % 4294967296 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:02:18,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE