./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --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 b5dffede99f44b56700e49bba8b9a9a3ca731f62c8b977aafab52c5b5e08267b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:02:37,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:02:37,167 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:02:37,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:02:37,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:02:37,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:02:37,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:02:37,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:02:37,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:02:37,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:02:37,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:02:37,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:02:37,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:02:37,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:02:37,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:02:37,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:02:37,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:02:37,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:02:37,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:02:37,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:02:37,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:02:37,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:02:37,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:02:37,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:02:37,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:02:37,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:02:37,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:02:37,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:02:37,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:02:37,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:02:37,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:02:37,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:02:37,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:02:37,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:02:37,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:02:37,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:02:37,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:02:37,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:02:37,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:02:37,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:02:37,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:02:37,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:02:37,227 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd 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(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 -> b5dffede99f44b56700e49bba8b9a9a3ca731f62c8b977aafab52c5b5e08267b [2024-11-13 15:02:37,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:02:37,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:02:37,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:02:37,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:02:37,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:02:37,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i Unable to find full path for "g++" [2024-11-13 15:02:39,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:02:39,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:02:39,907 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i [2024-11-13 15:02:39,923 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/data/27104f8a3/8e1f1b9e8bb3457fb0f6d7c8e7ac41ac/FLAGa90a89459 [2024-11-13 15:02:39,937 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/data/27104f8a3/8e1f1b9e8bb3457fb0f6d7c8e7ac41ac [2024-11-13 15:02:39,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:02:39,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:02:39,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:02:39,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:02:39,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:02:39,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:02:39" (1/1) ... [2024-11-13 15:02:39,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e18c013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:39, skipping insertion in model container [2024-11-13 15:02:39,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:02:39" (1/1) ... [2024-11-13 15:02:39,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:02:40,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i[919,932] [2024-11-13 15:02:40,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:02:40,226 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:02:40,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i[919,932] [2024-11-13 15:02:40,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:02:40,305 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:02:40,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40 WrapperNode [2024-11-13 15:02:40,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:02:40,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:02:40,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:02:40,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:02:40,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,386 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-13 15:02:40,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:02:40,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:02:40,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:02:40,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:02:40,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,414 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-13 15:02:40,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:02:40,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:02:40,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:02:40,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:02:40,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (1/1) ... [2024-11-13 15:02:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:02:40,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:40,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:02:40,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:02:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:02:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:02:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:02:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:02:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:02:40,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:02:40,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:02:40,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:02:41,005 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-13 15:02:41,005 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:02:41,016 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:02:41,016 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:02:41,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:02:41 BoogieIcfgContainer [2024-11-13 15:02:41,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:02:41,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:02:41,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:02:41,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:02:41,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:02:39" (1/3) ... [2024-11-13 15:02:41,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c67c404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:02:41, skipping insertion in model container [2024-11-13 15:02:41,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:40" (2/3) ... [2024-11-13 15:02:41,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c67c404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:02:41, skipping insertion in model container [2024-11-13 15:02:41,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:02:41" (3/3) ... [2024-11-13 15:02:41,029 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-62.i [2024-11-13 15:02:41,045 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:02:41,050 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-62.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:02:41,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:02:41,148 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e7e0de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:02:41,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:02:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 47 states have (on average 1.425531914893617) internal successors, (67), 48 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:02:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 15:02:41,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:41,163 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:02:41,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1157469852, now seen corresponding path program 1 times [2024-11-13 15:02:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444216121] [2024-11-13 15:02:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:41,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:02:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:02:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 15:02:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:02:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 15:02:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-13 15:02:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:02:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:02:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:02:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:02:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:02:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 15:02:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 15:02:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:02:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:02:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:02:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:02:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:02:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 15:02:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:02:41,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444216121] [2024-11-13 15:02:41,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444216121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:41,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:41,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:02:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575303655] [2024-11-13 15:02:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:41,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:02:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:02:41,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:02:41,582 INFO L87 Difference]: Start difference. First operand has 69 states, 47 states have (on average 1.425531914893617) internal successors, (67), 48 states have internal predecessors, (67), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:02:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:41,617 INFO L93 Difference]: Finished difference Result 127 states and 217 transitions. [2024-11-13 15:02:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:02:41,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2024-11-13 15:02:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:41,625 INFO L225 Difference]: With dead ends: 127 [2024-11-13 15:02:41,625 INFO L226 Difference]: Without dead ends: 61 [2024-11-13 15:02:41,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:02:41,630 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:41,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:02:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-13 15:02:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-13 15:02:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:02:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-11-13 15:02:41,695 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 124 [2024-11-13 15:02:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:41,695 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-11-13 15:02:41,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:02:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2024-11-13 15:02:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 15:02:41,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:41,699 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:02:41,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:02:41,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:41,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1707722090, now seen corresponding path program 1 times [2024-11-13 15:02:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:41,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242609729] [2024-11-13 15:02:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:02:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:02:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 15:02:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:02:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 15:02:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-13 15:02:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:02:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:02:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:02:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:02:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:02:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 15:02:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 15:02:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:02:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:02:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:02:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 15:02:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:02:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 15:02:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:02:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:02:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:02:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242609729] [2024-11-13 15:02:42,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242609729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:02:42,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:02:42,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:02:42,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56865489] [2024-11-13 15:02:42,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:02:42,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:02:42,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:02:42,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:02:42,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:02:42,365 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:02:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:02:42,632 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2024-11-13 15:02:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:02:42,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-11-13 15:02:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:02:42,636 INFO L225 Difference]: With dead ends: 185 [2024-11-13 15:02:42,636 INFO L226 Difference]: Without dead ends: 127 [2024-11-13 15:02:42,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:02:42,640 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 80 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:02:42,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 274 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:02:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-13 15:02:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 94. [2024-11-13 15:02:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 15:02:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-11-13 15:02:42,671 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 124 [2024-11-13 15:02:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:02:42,672 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-11-13 15:02:42,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:02:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-11-13 15:02:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 15:02:42,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:02:42,674 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:02:42,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:02:42,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:02:42,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:02:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash -812237844, now seen corresponding path program 1 times [2024-11-13 15:02:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:02:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654772080] [2024-11-13 15:02:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:02:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:02:42,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873699416] [2024-11-13 15:02:42,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:02:42,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:42,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:42,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:02:42,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:02:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:02:43,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:02:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:02:43,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:02:43,258 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:02:43,259 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:02:43,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:02:43,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:02:43,469 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 15:02:43,548 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:02:43,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:02:43 BoogieIcfgContainer [2024-11-13 15:02:43,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:02:43,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:02:43,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:02:43,554 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:02:43,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:02:41" (3/4) ... [2024-11-13 15:02:43,557 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:02:43,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:02:43,559 INFO L158 Benchmark]: Toolchain (without parser) took 3618.30ms. Allocated memory is still 142.6MB. Free memory was 119.0MB in the beginning and 93.2MB in the end (delta: 25.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-13 15:02:43,559 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:02:43,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.16ms. Allocated memory is still 142.6MB. Free memory was 119.0MB in the beginning and 105.5MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:02:43,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.21ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 102.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:02:43,560 INFO L158 Benchmark]: Boogie Preprocessor took 46.87ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 99.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:02:43,561 INFO L158 Benchmark]: RCFGBuilder took 581.57ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 79.5MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:02:43,561 INFO L158 Benchmark]: TraceAbstraction took 2532.67ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 93.3MB in the end (delta: -14.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:02:43,561 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 93.2MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:02:43,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.16ms. Allocated memory is still 142.6MB. Free memory was 119.0MB in the beginning and 105.5MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.21ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 102.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.87ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 99.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 581.57ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 79.5MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2532.67ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 93.3MB in the end (delta: -14.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 93.2MB in the end (delta: 24.0kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 57, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.25; [L23] signed long int var_1_3 = -25; [L24] signed long int var_1_4 = -128; [L25] double var_1_6 = 2.75; [L26] double var_1_7 = 24.5; [L27] double var_1_8 = 199.5; [L28] float var_1_9 = 32.8; [L29] unsigned char var_1_10 = 1; [L30] float var_1_11 = 15.4; [L31] float var_1_12 = 0.0; [L32] unsigned long int var_1_13 = 2; [L33] float var_1_16 = 127.6; [L34] signed long int var_1_17 = 128; [L35] unsigned char var_1_19 = 10; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 64; [L38] double var_1_22 = 15.95; [L39] unsigned long int var_1_23 = 4127848294; VAL [isInitial=0, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=-25, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] FCALL updateLastVariables() [L120] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L79] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L80] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L80] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L81] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L81] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L82] var_1_4 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L83] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L84] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L84] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L85] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L85] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L86] var_1_6 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L87] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L88] var_1_7 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_8=399/2, var_1_9=164/5] [L89] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_8=399/2, var_1_9=164/5] [L90] var_1_8 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L91] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L92] var_1_10 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L93] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L94] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L94] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L95] var_1_11 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L96] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L97] var_1_12 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L98] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L99] var_1_20 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L100] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L101] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L101] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L102] var_1_21 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L103] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L104] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L104] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=4127848294, var_1_3=2, var_1_4=2, var_1_9=164/5] [L105] var_1_23 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_9=164/5] [L106] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_9=164/5] [L107] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_9=164/5] [L107] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_9=164/5] [L120] RET updateVariables() [L121] CALL step() [L43] COND TRUE var_1_12 <= (var_1_7 * 5.8f) [L44] var_1_16 = ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=164/5] [L48] COND TRUE var_1_10 || var_1_20 [L49] var_1_19 = ((((var_1_21) > (32)) ? (var_1_21) : (32))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=33, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=164/5] [L51] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=33, var_1_1=21/4, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=164/5] [L56] COND TRUE var_1_19 > ((var_1_3 % var_1_4) * var_1_19) [L57] var_1_1 = (var_1_6 - (var_1_7 + var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=33, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=164/5] [L61] COND TRUE ! var_1_10 [L62] var_1_13 = (50u + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=83, var_1_16=2, var_1_17=128, var_1_19=33, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=164/5] [L66] COND FALSE !(var_1_8 < (var_1_22 / var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=83, var_1_16=2, var_1_17=128, var_1_19=33, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=164/5] [L71] COND FALSE !(var_1_10 || (var_1_19 == var_1_13)) [L74] var_1_9 = ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=83, var_1_16=2, var_1_17=128, var_1_19=33, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=3] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=83, var_1_16=2, var_1_17=128, var_1_19=33, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=3] [L112-L113] return (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=83, var_1_16=2, var_1_17=128, var_1_19=33, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=83, var_1_16=2, var_1_17=128, var_1_19=33, var_1_20=1, var_1_21=-223, var_1_22=319/20, var_1_23=2147483647, var_1_3=2, var_1_4=2, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 203 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 15:02:43,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --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 b5dffede99f44b56700e49bba8b9a9a3ca731f62c8b977aafab52c5b5e08267b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:02:46,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:02:46,663 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:02:46,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:02:46,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:02:46,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:02:46,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:02:46,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:02:46,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:02:46,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:02:46,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:02:46,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:02:46,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:02:46,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:02:46,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:02:46,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:02:46,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:02:46,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:02:46,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:02:46,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:02:46,719 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:02:46,719 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:02:46,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:02:46,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:02:46,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:02:46,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:02:46,719 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd 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(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 -> b5dffede99f44b56700e49bba8b9a9a3ca731f62c8b977aafab52c5b5e08267b [2024-11-13 15:02:47,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:02:47,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:02:47,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:02:47,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:02:47,058 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:02:47,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i Unable to find full path for "g++" [2024-11-13 15:02:49,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:02:49,432 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:02:49,433 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i [2024-11-13 15:02:49,443 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/data/2cca0ccfc/a037ed4bfb6345e0af00d31eb4068807/FLAG018a75a81 [2024-11-13 15:02:49,460 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/data/2cca0ccfc/a037ed4bfb6345e0af00d31eb4068807 [2024-11-13 15:02:49,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:02:49,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:02:49,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:02:49,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:02:49,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:02:49,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:49,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2819be6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49, skipping insertion in model container [2024-11-13 15:02:49,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:49,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:02:49,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i[919,932] [2024-11-13 15:02:49,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:02:49,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:02:49,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-62.i[919,932] [2024-11-13 15:02:49,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:02:49,895 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:02:49,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49 WrapperNode [2024-11-13 15:02:49,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:02:49,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:02:49,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:02:49,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:02:49,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:49,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:49,965 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-13 15:02:49,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:02:49,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:02:49,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:02:49,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:02:49,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:49,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:49,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:50,002 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-13 15:02:50,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:50,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:50,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:50,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:50,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:50,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:50,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:02:50,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:02:50,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:02:50,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:02:50,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (1/1) ... [2024-11-13 15:02:50,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:02:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:02:50,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:02:50,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:02:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:02:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:02:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:02:50,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:02:50,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:02:50,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:02:50,181 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:02:50,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:03:20,269 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 15:03:20,269 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:03:20,280 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:03:20,281 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:03:20,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:03:20 BoogieIcfgContainer [2024-11-13 15:03:20,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:03:20,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:03:20,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:03:20,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:03:20,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:02:49" (1/3) ... [2024-11-13 15:03:20,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa16700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:03:20, skipping insertion in model container [2024-11-13 15:03:20,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:02:49" (2/3) ... [2024-11-13 15:03:20,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa16700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:03:20, skipping insertion in model container [2024-11-13 15:03:20,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:03:20" (3/3) ... [2024-11-13 15:03:20,296 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-62.i [2024-11-13 15:03:20,312 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:03:20,314 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-62.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:03:20,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:03:20,419 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@47a99466, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:03:20,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:03:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:03:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 15:03:20,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:20,440 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:03:20,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:20,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash 593908620, now seen corresponding path program 1 times [2024-11-13 15:03:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:03:20,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726999895] [2024-11-13 15:03:20,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:20,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:03:20,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:03:20,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:03:20,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 15:03:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:22,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:03:22,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-13 15:03:22,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:03:22,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:03:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726999895] [2024-11-13 15:03:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726999895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:22,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:03:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513222528] [2024-11-13 15:03:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:22,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:03:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:03:22,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:03:22,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:03:22,192 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:03:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:22,219 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2024-11-13 15:03:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:03:22,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-13 15:03:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:22,227 INFO L225 Difference]: With dead ends: 109 [2024-11-13 15:03:22,227 INFO L226 Difference]: Without dead ends: 54 [2024-11-13 15:03:22,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:03:22,233 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:22,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-13 15:03:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-13 15:03:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:03:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2024-11-13 15:03:22,276 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 122 [2024-11-13 15:03:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:22,277 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2024-11-13 15:03:22,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:03:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2024-11-13 15:03:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 15:03:22,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:22,280 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:03:22,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 15:03:22,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:03:22,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:22,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash 440465682, now seen corresponding path program 1 times [2024-11-13 15:03:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:03:22,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22551356] [2024-11-13 15:03:22,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:22,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:03:22,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:03:22,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:03:22,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 15:03:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:24,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:03:24,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:03:24,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:03:24,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:03:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22551356] [2024-11-13 15:03:24,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22551356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:24,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:24,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:24,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185376109] [2024-11-13 15:03:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:24,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:24,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:03:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:24,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:24,317 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:03:28,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:03:31,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:03:35,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:03:40,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:03:44,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:03:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:44,788 INFO L93 Difference]: Finished difference Result 137 states and 205 transitions. [2024-11-13 15:03:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-13 15:03:44,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:44,793 INFO L225 Difference]: With dead ends: 137 [2024-11-13 15:03:44,793 INFO L226 Difference]: Without dead ends: 86 [2024-11-13 15:03:44,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:44,795 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:44,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 175 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 20.4s Time] [2024-11-13 15:03:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-13 15:03:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-13 15:03:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 53 states have internal predecessors, (67), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 15:03:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-11-13 15:03:44,817 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 122 [2024-11-13 15:03:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:44,818 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-11-13 15:03:44,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:03:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-11-13 15:03:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 15:03:44,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:44,821 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:03:44,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 15:03:45,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:03:45,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:45,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1334541680, now seen corresponding path program 1 times [2024-11-13 15:03:45,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:03:45,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293363715] [2024-11-13 15:03:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:45,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:03:45,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:03:45,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:03:45,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_160febc2-de52-4aa8-9993-78c174c2661a/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 15:03:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:47,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 15:03:47,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:04:28,562 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:04:36,801 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:04:48,078 WARN L286 SmtUtils]: Spent 7.60s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:04:53,425 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:04:58,616 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:05:17,453 WARN L286 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:05:23,021 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:05:37,793 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:05:54,289 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:06:06,552 WARN L286 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:06:12,017 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:06:18,225 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:06:22,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse7) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse8) (fp.geq c_~var_1_11~0 .cse9)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse8)) (fp.leq c_~var_1_11~0 (fp.neg .cse9))))) (fp.geq c_~var_1_12~0 .cse9) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse7)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 15:06:26,292 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse7) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse8) (fp.geq c_~var_1_11~0 .cse9)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse8)) (fp.leq c_~var_1_11~0 (fp.neg .cse9))))) (fp.geq c_~var_1_12~0 .cse9) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse7)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 15:06:43,469 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:06:50,276 WARN L286 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:07:02,889 WARN L286 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:07:09,251 WARN L286 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:07:18,919 WARN L286 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:07:26,561 WARN L286 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:07:31,799 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:07:41,961 WARN L286 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:08:01,520 WARN L286 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:08:16,115 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:08:33,381 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:08:38,856 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:08:45,421 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 15:08:51,201 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:09:03,535 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:09:24,246 WARN L286 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:09:33,369 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:09:50,649 WARN L286 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:10:08,570 WARN L286 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:10:26,173 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:10:50,820 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (= (_ bv0 8) c_~var_1_10~0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 15:10:59,062 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:11:07,287 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:11:15,466 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:11:23,646 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:11:31,830 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:11:40,008 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:11:48,168 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:11:55,557 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:12:03,180 WARN L286 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:12:11,348 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:12:19,511 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:12:27,688 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:12:35,829 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:12:43,986 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:12:52,122 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:13:00,313 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:13:07,990 WARN L286 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:13:14,972 WARN L286 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:13:23,126 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:13:31,277 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:13:39,491 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:13:47,712 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:13:55,940 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:14:04,511 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:14:12,687 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:14:20,866 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:14:29,055 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:14:37,295 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:14:45,480 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:14:53,701 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:14:57,750 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (= (_ bv0 8) c_~var_1_10~0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode c_~var_1_6~0 (fp.add c_currentRoundingMode c_~var_1_7~0 c_~var_1_8~0))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-13 15:15:01,790 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (and (fp.geq c_~var_1_6~0 .cse0) (= (_ bv0 8) c_~var_1_10~0) (fp.geq c_~var_1_8~0 .cse0) (fp.leq c_~var_1_7~0 .cse1) (fp.geq c_~var_1_7~0 .cse0) (let ((.cse3 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_8~0))) (.cse2 (fp.gt .cse6 c_~var_1_7~0))) (or (and (not .cse2) (let ((.cse4 (fp.lt c_~var_1_7~0 c_~var_1_8~0))) (or (and .cse3 (not .cse4)) (and .cse4 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_7~0)))))) (and (let ((.cse5 (fp.lt .cse6 c_~var_1_8~0))) (or (and .cse5 (= c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode .cse6))) (and .cse3 (not .cse5)))) .cse2))) (fp.leq .cse6 (fp.mul c_currentRoundingMode c_~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 29.0 5.0))))) (let ((.cse8 ((_ zero_extend 24) c_~var_1_21~0))) (let ((.cse7 (bvsgt .cse8 (_ bv32 32)))) (or (and .cse7 (= c_~var_1_19~0 ((_ extract 7 0) .cse8))) (and (= (_ bv32 8) c_~var_1_19~0) (not .cse7))))) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode c_~var_1_6~0 (fp.add c_currentRoundingMode c_~var_1_7~0 c_~var_1_8~0))) (fp.leq c_~var_1_8~0 .cse1) (fp.leq c_~var_1_12~0 .cse9) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.leq c_~var_1_11~0 .cse10) (fp.geq c_~var_1_11~0 .cse11)) (and (fp.geq c_~var_1_11~0 (fp.neg .cse10)) (fp.leq c_~var_1_11~0 (fp.neg .cse11))))) (fp.geq c_~var_1_12~0 .cse11) (fp.leq c_~var_1_6~0 ((_ to_fp 11 53) c_currentRoundingMode .cse9)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 15:15:10,107 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:15:18,255 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:15:26,454 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:15:34,649 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:15:42,857 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:15:51,059 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:15:59,237 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:16:07,426 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:16:15,613 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:16:23,793 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:16:31,988 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:16:40,169 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:16:48,296 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:16:56,488 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:17:04,628 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:17:12,855 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:17:21,070 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:17:26,417 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:17:34,553 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:17:42,716 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:17:50,898 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:17:59,078 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:18:07,257 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)