./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/float-benchs/bary_diverge.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/AutomizerTermination.xml -i ../sv-benchmarks/c/float-benchs/bary_diverge.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:28:03,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:28:03,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:28:03,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:28:03,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:28:03,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:28:03,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:28:03,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:28:03,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:28:03,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:28:03,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:28:03,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:28:03,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:28:03,986 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:28:03,987 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:28:03,987 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:28:03,987 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:28:03,988 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:28:03,988 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:28:03,988 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:28:03,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:28:03,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:28:03,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:28:03,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:28:03,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:28:03,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:28:03,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:28:03,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:28:03,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:28:03,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:28:03,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:28:03,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:28:03,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:28:03,990 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:28:03,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:28:03,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:28:03,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:28:03,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:28:03,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:28:03,991 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:28:03,992 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 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(F end) ) 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2024-11-17 08:28:04,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:28:04,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:28:04,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:28:04,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:28:04,230 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:28:04,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/bary_diverge.c [2024-11-17 08:28:05,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:28:05,718 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:28:05,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c [2024-11-17 08:28:05,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b6444a2/333576708f61468abb6260b583bed61f/FLAG1438c1798 [2024-11-17 08:28:05,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b6444a2/333576708f61468abb6260b583bed61f [2024-11-17 08:28:05,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:28:05,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:28:05,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:28:05,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:28:05,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:28:05,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:05,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cb196e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05, skipping insertion in model container [2024-11-17 08:28:05,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:05,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:28:05,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:28:05,939 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:28:05,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:28:05,969 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:28:05,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05 WrapperNode [2024-11-17 08:28:05,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:28:05,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:28:05,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:28:05,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:28:05,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:05,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:05,997 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 109 [2024-11-17 08:28:05,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:28:05,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:28:05,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:28:05,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:28:06,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,017 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 08:28:06,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:28:06,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:28:06,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:28:06,026 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:28:06,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (1/1) ... [2024-11-17 08:28:06,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:28:06,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:28:06,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:28:06,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:28:06,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:28:06,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:28:06,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:28:06,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:28:06,200 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:28:06,202 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:28:06,313 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-17 08:28:06,314 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:28:06,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:28:06,323 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:28:06,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:28:06 BoogieIcfgContainer [2024-11-17 08:28:06,323 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:28:06,324 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:28:06,324 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:28:06,327 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:28:06,328 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:28:06,328 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:28:05" (1/3) ... [2024-11-17 08:28:06,329 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b8960ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:28:06, skipping insertion in model container [2024-11-17 08:28:06,329 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:28:06,329 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:05" (2/3) ... [2024-11-17 08:28:06,329 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b8960ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:28:06, skipping insertion in model container [2024-11-17 08:28:06,329 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:28:06,329 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:28:06" (3/3) ... [2024-11-17 08:28:06,330 INFO L332 chiAutomizerObserver]: Analyzing ICFG bary_diverge.c [2024-11-17 08:28:06,371 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:28:06,372 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:28:06,372 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:28:06,372 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:28:06,372 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:28:06,372 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:28:06,372 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:28:06,372 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:28:06,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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) [2024-11-17 08:28:06,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-17 08:28:06,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:28:06,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:28:06,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:28:06,402 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:28:06,402 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:28:06,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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) [2024-11-17 08:28:06,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-17 08:28:06,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:28:06,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:28:06,408 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:28:06,408 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:28:06,415 INFO L745 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~INIT~0 := 0;~C1~0 := 0.0;~I~0 := 0.0;~X~0 := 0.0;~Y~0 := 0.0;~Z~0 := 0.0; 28#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~ret6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~post10#1, main_~i~0#1;havoc main_~i~0#1;~INIT~0 := 1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 11#L12-4true assume !(0 == assume_abort_if_not_~cond#1); 22#assume_abort_if_not_returnLabel#1true assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 8#L27-4true assume true;main_#t~ret5#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~C1~0 := main_#t~ret5#1;havoc main_#t~ret5#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 16#L12-3true assume !(0 == assume_abort_if_not_~cond#1); 30#assume_abort_if_not_returnLabel#2true assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 31#L27-3true assume true;main_#t~ret6#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~I~0 := main_#t~ret6#1;havoc main_#t~ret6#1;main_~i~0#1 := 0; 5#L61true [2024-11-17 08:28:06,416 INFO L747 eck$LassoCheckResult]: Loop: 5#L61true assume true; 10#L61-1true assume !!(main_~i~0#1 < 3600000);assume { :begin_inline_bary } true; 20#L36true assume ~someBinaryFLOATComparisonOperation(~C1~0, 0.0);~Z~0 := ~Y~0;~Y~0 := ~X~0; 26#L41true assume 1 == ~INIT~0;~X~0 := ~I~0;~Y~0 := ~I~0;~Z~0 := ~I~0; 7#L50true assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(~X~0, ~someUnaryFLOAToperation(5.0)) && ~someBinaryFLOATComparisonOperation(~X~0, 5.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12#L14-1true assume !(0 == __VERIFIER_assert_~cond#1); 24#L14true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 29#bary_returnLabel#1true assume true;assume { :end_inline_bary } true;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 3#L12-2true assume 0 == assume_abort_if_not_~cond#1;assume false; 21#assume_abort_if_not_returnLabel#3true assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 9#L27-2true assume true;main_#t~ret7#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~INIT~0 := ~convertFLOATToINT(main_#t~ret7#1);havoc main_#t~ret7#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 4#L12-1true assume 0 == assume_abort_if_not_~cond#1;assume false; 19#assume_abort_if_not_returnLabel#4true assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 32#L27-1true assume true;main_#t~ret8#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~C1~0 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 13#L12true assume 0 == assume_abort_if_not_~cond#1;assume false; 6#assume_abort_if_not_returnLabel#5true assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 18#L27true assume true;main_#t~ret9#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~I~0 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_wait_for_clock } true; 27#wait_for_clock_returnLabel#1true assume true;assume { :end_inline_wait_for_clock } true;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5#L61true [2024-11-17 08:28:06,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:28:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash 364930779, now seen corresponding path program 1 times [2024-11-17 08:28:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:28:06,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446299350] [2024-11-17 08:28:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:28:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:28:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:28:06,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:28:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:28:06,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:28:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:28:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 126648853, now seen corresponding path program 1 times [2024-11-17 08:28:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:28:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783384700] [2024-11-17 08:28:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:28:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:28:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:28:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:28:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:28:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783384700] [2024-11-17 08:28:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783384700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:28:06,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:28:06,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:28:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168789155] [2024-11-17 08:28:06,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:28:06,659 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:28:06,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:28:06,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:28:06,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:28:06,692 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2024-11-17 08:28:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:28:06,700 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-17 08:28:06,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2024-11-17 08:28:06,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:28:06,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 28 transitions. [2024-11-17 08:28:06,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-17 08:28:06,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-17 08:28:06,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-11-17 08:28:06,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:28:06,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-17 08:28:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-11-17 08:28:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-17 08:28:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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) [2024-11-17 08:28:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-17 08:28:06,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-17 08:28:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:28:06,732 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-17 08:28:06,732 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:28:06,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2024-11-17 08:28:06,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:28:06,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:28:06,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:28:06,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:28:06,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:28:06,733 INFO L745 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~INIT~0 := 0;~C1~0 := 0.0;~I~0 := 0.0;~X~0 := 0.0;~Y~0 := 0.0;~Z~0 := 0.0; 90#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~ret6#1, main_#t~ret7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~post10#1, main_~i~0#1;havoc main_~i~0#1;~INIT~0 := 1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 85#L12-4 assume !(0 == assume_abort_if_not_~cond#1); 86#assume_abort_if_not_returnLabel#1 assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 81#L27-4 assume true;main_#t~ret5#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~C1~0 := main_#t~ret5#1;havoc main_#t~ret5#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 82#L12-3 assume !(0 == assume_abort_if_not_~cond#1); 91#assume_abort_if_not_returnLabel#2 assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 96#L27-3 assume true;main_#t~ret6#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~I~0 := main_#t~ret6#1;havoc main_#t~ret6#1;main_~i~0#1 := 0; 75#L61 [2024-11-17 08:28:06,734 INFO L747 eck$LassoCheckResult]: Loop: 75#L61 assume true; 76#L61-1 assume !!(main_~i~0#1 < 3600000);assume { :begin_inline_bary } true; 84#L36 assume ~someBinaryFLOATComparisonOperation(~C1~0, 0.0);~Z~0 := ~Y~0;~Y~0 := ~X~0; 94#L41 assume 1 == ~INIT~0;~X~0 := ~I~0;~Y~0 := ~I~0;~Z~0 := ~I~0; 79#L50 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(~X~0, ~someUnaryFLOAToperation(5.0)) && ~someBinaryFLOATComparisonOperation(~X~0, 5.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 80#L14-1 assume !(0 == __VERIFIER_assert_~cond#1); 87#L14 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 95#bary_returnLabel#1 assume true;assume { :end_inline_bary } true;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 71#L12-2 assume !(0 == assume_abort_if_not_~cond#1); 72#assume_abort_if_not_returnLabel#3 assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 83#L27-2 assume true;main_#t~ret7#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~INIT~0 := ~convertFLOATToINT(main_#t~ret7#1);havoc main_#t~ret7#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 73#L12-1 assume !(0 == assume_abort_if_not_~cond#1); 74#assume_abort_if_not_returnLabel#4 assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 93#L27-1 assume true;main_#t~ret8#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~C1~0 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_RANDOM_INPUT } true;havoc RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_~x~0#1;havoc RANDOM_INPUT_#t~nondet4#1;RANDOM_INPUT_~x~0#1 := RANDOM_INPUT_#t~nondet4#1;havoc RANDOM_INPUT_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(RANDOM_INPUT_~x~0#1, 1.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 88#L12 assume !(0 == assume_abort_if_not_~cond#1); 77#assume_abort_if_not_returnLabel#5 assume true;havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;RANDOM_INPUT_#res#1 := RANDOM_INPUT_~x~0#1; 78#L27 assume true;main_#t~ret9#1 := RANDOM_INPUT_#res#1;havoc RANDOM_INPUT_#t~nondet4#1, RANDOM_INPUT_~x~0#1;assume { :end_inline_RANDOM_INPUT } true;~I~0 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_wait_for_clock } true; 92#wait_for_clock_returnLabel#1 assume true;assume { :end_inline_wait_for_clock } true;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 75#L61 [2024-11-17 08:28:06,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:28:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash 364930779, now seen corresponding path program 2 times [2024-11-17 08:28:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:28:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626771448] [2024-11-17 08:28:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:28:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:28:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:28:06,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:28:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:28:06,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:28:06,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:28:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 817668820, now seen corresponding path program 1 times [2024-11-17 08:28:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:28:06,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687882865] [2024-11-17 08:28:06,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:28:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:28:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:28:06,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:28:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:28:06,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:28:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:28:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1552336686, now seen corresponding path program 1 times [2024-11-17 08:28:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:28:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454599990] [2024-11-17 08:28:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:28:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:28:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:28:06,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:28:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:28:06,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:28:07,040 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:28:07,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:28:07,041 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:28:07,041 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:28:07,041 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:28:07,041 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:28:07,041 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:28:07,041 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:28:07,041 INFO L132 ssoRankerPreferences]: Filename of dumped script: bary_diverge.c_Iteration2_Loop [2024-11-17 08:28:07,041 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:28:07,041 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:28:07,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,253 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:28:07,254 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:28:07,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:28:07,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:28:07,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:28:07,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:28:07,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:28:07,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:28:07,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:28:07,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:28:07,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:28:07,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:28:07,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:28:07,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:28:07,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:28:07,322 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:28:07,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:28:07,327 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:28:07,328 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:28:07,328 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:28:07,328 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:28:07,328 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:28:07,328 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:28:07,328 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:28:07,328 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:28:07,328 INFO L132 ssoRankerPreferences]: Filename of dumped script: bary_diverge.c_Iteration2_Loop [2024-11-17 08:28:07,328 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:28:07,328 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:28:07,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:28:07,452 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:28:07,455 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:28:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:28:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:28:07,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:28:07,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:28:07,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:28:07,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:28:07,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:28:07,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:28:07,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:28:07,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:28:07,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:28:07,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:28:07,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:28:07,478 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:28:07,479 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:28:07,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:28:07,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:28:07,499 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:28:07,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:28:07,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:28:07,511 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:28:07,512 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:28:07,512 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 7199999 Supporting invariants [] [2024-11-17 08:28:07,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:28:07,526 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:28:07,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:28:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:28:07,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:28:07,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:28:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:28:07,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:28:07,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:28:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:28:07,723 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:28:07,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 28 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-17 08:28:07,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 28 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) Result 44 states and 49 transitions. Complement of second has 6 states. [2024-11-17 08:28:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:28:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-17 08:28:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2024-11-17 08:28:07,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 18 letters. [2024-11-17 08:28:07,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:28:07,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 26 letters. Loop has 18 letters. [2024-11-17 08:28:07,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:28:07,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 36 letters. [2024-11-17 08:28:07,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:28:07,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2024-11-17 08:28:07,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:28:07,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2024-11-17 08:28:07,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:28:07,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:28:07,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:28:07,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:28:07,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:28:07,769 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:28:07,769 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:28:07,769 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:28:07,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:28:07,770 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:28:07,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:28:07,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:28:07 BoogieIcfgContainer [2024-11-17 08:28:07,775 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:28:07,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:28:07,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:28:07,777 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:28:07,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:28:06" (3/4) ... [2024-11-17 08:28:07,779 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:28:07,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:28:07,780 INFO L158 Benchmark]: Toolchain (without parser) took 2040.99ms. Allocated memory is still 182.5MB. Free memory was 112.4MB in the beginning and 114.6MB in the end (delta: -2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:28:07,781 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:28:07,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.20ms. Allocated memory is still 182.5MB. Free memory was 112.2MB in the beginning and 99.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:28:07,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.69ms. Allocated memory is still 182.5MB. Free memory was 99.6MB in the beginning and 97.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:28:07,782 INFO L158 Benchmark]: Boogie Preprocessor took 27.27ms. Allocated memory is still 182.5MB. Free memory was 97.8MB in the beginning and 95.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:28:07,784 INFO L158 Benchmark]: IcfgBuilder took 297.35ms. Allocated memory is still 182.5MB. Free memory was 95.9MB in the beginning and 142.7MB in the end (delta: -46.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 08:28:07,784 INFO L158 Benchmark]: BuchiAutomizer took 1451.38ms. Allocated memory is still 182.5MB. Free memory was 141.9MB in the beginning and 114.6MB in the end (delta: 27.4MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-11-17 08:28:07,784 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 182.5MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:28:07,787 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.20ms. Allocated memory is still 182.5MB. Free memory was 112.2MB in the beginning and 99.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.69ms. Allocated memory is still 182.5MB. Free memory was 99.6MB in the beginning and 97.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.27ms. Allocated memory is still 182.5MB. Free memory was 97.8MB in the beginning and 95.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 297.35ms. Allocated memory is still 182.5MB. Free memory was 95.9MB in the beginning and 142.7MB in the end (delta: -46.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 1451.38ms. Allocated memory is still 182.5MB. Free memory was 141.9MB in the beginning and 114.6MB in the end (delta: 27.4MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 182.5MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 7199999) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 59 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax154 hnf100 lsp32 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 55ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:28:07,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:28:08,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE