./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB --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 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:24:02,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:24:02,510 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:24:02,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:24:02,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:24:02,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:24:02,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:24:02,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:24:02,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:24:02,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:24:02,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:24:02,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:24:02,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:24:02,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:24:02,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:24:02,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:24:02,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:24:02,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:24:02,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:24:02,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:24:02,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:24:02,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:24:02,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:24:02,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:24:02,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:24:02,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:24:02,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:24:02,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:24:02,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:24:02,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:02,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:02,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:02,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:02,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:24:02,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:02,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:02,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:02,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:02,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:24:02,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:24:02,554 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:24:02,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:24:02,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:24:02,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:24:02,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:24:02,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:24:02,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:24:02,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:24:02,556 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_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a [2024-11-28 03:24:02,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:24:02,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:24:02,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:24:02,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:24:02,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:24:02,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2024-11-28 03:24:06,262 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data/ea4e16e02/d16c51bd52894584959ccb1350dd2168/FLAG6d6a324e3 [2024-11-28 03:24:06,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:24:06,651 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2024-11-28 03:24:06,666 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data/ea4e16e02/d16c51bd52894584959ccb1350dd2168/FLAG6d6a324e3 [2024-11-28 03:24:06,858 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data/ea4e16e02/d16c51bd52894584959ccb1350dd2168 [2024-11-28 03:24:06,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:24:06,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:24:06,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:24:06,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:24:06,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:24:06,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:24:06" (1/1) ... [2024-11-28 03:24:06,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5c8829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:06, skipping insertion in model container [2024-11-28 03:24:06,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:24:06" (1/1) ... [2024-11-28 03:24:06,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:24:07,089 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_236e5a9b-8259-4265-a40b-18e2cefa5b20/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2024-11-28 03:24:07,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:24:07,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:24:07,184 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_236e5a9b-8259-4265-a40b-18e2cefa5b20/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2024-11-28 03:24:07,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:24:07,222 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:24:07,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07 WrapperNode [2024-11-28 03:24:07,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:24:07,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:24:07,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:24:07,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:24:07,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,270 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-28 03:24:07,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:24:07,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:24:07,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:24:07,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:24:07,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,299 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-28 03:24:07,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:24:07,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:24:07,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:24:07,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:24:07,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (1/1) ... [2024-11-28 03:24:07,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:07,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:07,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:24:07,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:24:07,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:24:07,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:24:07,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:24:07,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:24:07,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:24:07,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:24:07,482 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:24:07,485 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:24:07,749 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-28 03:24:07,749 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:24:07,763 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:24:07,763 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:24:07,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:07 BoogieIcfgContainer [2024-11-28 03:24:07,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:24:07,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:24:07,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:24:07,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:24:07,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:24:06" (1/3) ... [2024-11-28 03:24:07,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58faf4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:24:07, skipping insertion in model container [2024-11-28 03:24:07,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:07" (2/3) ... [2024-11-28 03:24:07,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58faf4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:24:07, skipping insertion in model container [2024-11-28 03:24:07,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:07" (3/3) ... [2024-11-28 03:24:07,775 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-62.i [2024-11-28 03:24:07,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:24:07,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-62.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:24:07,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:24:07,897 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;@3d377b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:24:07,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:24:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-28 03:24:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 03:24:07,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:07,915 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-28 03:24:07,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:24:07,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1942112404, now seen corresponding path program 1 times [2024-11-28 03:24:07,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:07,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041805089] [2024-11-28 03:24:07,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-28 03:24:08,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:08,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041805089] [2024-11-28 03:24:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041805089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:24:08,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701708999] [2024-11-28 03:24:08,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:08,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:08,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:08,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:08,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:24:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:08,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:24:08,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-28 03:24:08,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:08,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701708999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:08,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:24:08,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 03:24:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164309341] [2024-11-28 03:24:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:08,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:24:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:08,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:24:08,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:24:08,622 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:24:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:08,655 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2024-11-28 03:24:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:24:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-11-28 03:24:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:08,664 INFO L225 Difference]: With dead ends: 85 [2024-11-28 03:24:08,665 INFO L226 Difference]: Without dead ends: 42 [2024-11-28 03:24:08,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-28 03:24:08,672 INFO L435 NwaCegarLoop]: 59 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, 59 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-28 03:24:08,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:24:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-28 03:24:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-28 03:24:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-28 03:24:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-28 03:24:08,714 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 91 [2024-11-28 03:24:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:08,715 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-28 03:24:08,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:24:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-28 03:24:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 03:24:08,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:08,719 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-28 03:24:08,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:24:08,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 03:24:08,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:24:08,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1958631132, now seen corresponding path program 1 times [2024-11-28 03:24:08,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:08,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296426603] [2024-11-28 03:24:08,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:24:09,107 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:24:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:24:09,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:24:09,268 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:24:09,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:24:09,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:24:09,278 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-28 03:24:09,370 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:24:09,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:24:09 BoogieIcfgContainer [2024-11-28 03:24:09,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:24:09,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:24:09,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:24:09,378 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:24:09,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:07" (3/4) ... [2024-11-28 03:24:09,381 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:24:09,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:24:09,383 INFO L158 Benchmark]: Toolchain (without parser) took 2517.58ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 62.6MB in the end (delta: 29.7MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-28 03:24:09,383 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:09,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.66ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.4MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:24:09,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.54ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 77.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:09,384 INFO L158 Benchmark]: Boogie Preprocessor took 39.40ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:09,385 INFO L158 Benchmark]: RCFGBuilder took 448.85ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 63.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:24:09,385 INFO L158 Benchmark]: TraceAbstraction took 1610.54ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 63.1MB in the end (delta: -450.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:09,385 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 62.6MB in the end (delta: 541.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:09,387 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.66ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.4MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.54ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 77.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.40ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 448.85ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 63.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1610.54ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 63.1MB in the end (delta: -450.5kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 62.6MB in the end (delta: 541.3kB). 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 someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = -128; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -5; [L26] unsigned char var_1_5 = 16; [L27] unsigned char var_1_9 = 25; [L28] float var_1_10 = 2.5; [L29] signed char var_1_11 = 1; [L30] signed char var_1_12 = 4; [L31] float var_1_13 = 7.75; [L32] float var_1_14 = 64.75; [L33] float var_1_15 = 256.52; [L34] float var_1_16 = 3.25; VAL [isInitial=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L91] isInitial = 1 [L92] FCALL initially() [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L63] var_1_4 = __VERIFIER_nondet_char() [L64] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=25] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L69] var_1_11 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L71] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L71] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L74] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L74] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L76] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L78] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L95] RET updateVariables() [L96] CALL step() [L38] var_1_1 = (16 - 2) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_1=14, var_1_2=-128, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L39] COND TRUE \read(var_1_3) [L40] var_1_2 = ((((-4) < 0 ) ? -(-4) : (-4))) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=17, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L44] COND FALSE !(var_1_4 < ((16 + var_1_11) - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=17, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-1, var_1_5=16, var_1_9=254] [L53] COND TRUE (var_1_10 * var_1_10) > var_1_10 [L54] var_1_5 = (((((25) < (5)) ? (25) : (5))) + 10) VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=17, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-1, var_1_5=15, var_1_9=254] [L96] RET step() [L97] CALL, EXPR property() [L87-L88] return (((var_1_1 == ((signed char) (16 - 2))) && (var_1_3 ? (var_1_2 == ((signed char) ((((-4) < 0 ) ? -(-4) : (-4))))) : (var_1_2 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (((var_1_10 * var_1_10) > var_1_10) ? (var_1_5 == ((unsigned char) (((((25) < (5)) ? (25) : (5))) + 10))) : (var_1_5 == ((unsigned char) var_1_9)))) && ((var_1_4 < ((16 + var_1_11) - var_1_12)) ? (var_1_3 ? (var_1_10 == ((float) ((var_1_13 + 50.6f) + var_1_14))) : (var_1_10 == ((float) (var_1_15 - var_1_16)))) : (var_1_10 == ((float) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=261, var_1_11=0, var_1_12=17, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-1, var_1_5=15, var_1_9=254] [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=17, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-1, var_1_5=15, var_1_9=254] [L19] reach_error() VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=17, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=-1, var_1_5=15, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 59 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:24:09,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB --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 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:24:12,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:24:12,649 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 03:24:12,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:24:12,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:24:12,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:24:12,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:24:12,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:24:12,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:24:12,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:24:12,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:24:12,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:24:12,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:24:12,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:24:12,691 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:24:12,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:24:12,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:24:12,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:24:12,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:24:12,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:24:12,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:24:12,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:24:12,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:24:12,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:24:12,692 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:24:12,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:24:12,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:24:12,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:24:12,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:24:12,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:24:12,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:24:12,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:12,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:12,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:12,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:12,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:24:12,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:12,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:12,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:12,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:12,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:24:12,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:24:12,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:24:12,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:24:12,696 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:24:12,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:24:12,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:24:12,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:24:12,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:24:12,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:24:12,696 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_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a [2024-11-28 03:24:13,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:24:13,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:24:13,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:24:13,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:24:13,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:24:13,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2024-11-28 03:24:16,752 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data/68af53557/14b9788af9d24f42a020631febf0c4df/FLAGbb000eaa9 [2024-11-28 03:24:17,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:24:17,019 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2024-11-28 03:24:17,029 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data/68af53557/14b9788af9d24f42a020631febf0c4df/FLAGbb000eaa9 [2024-11-28 03:24:17,337 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/data/68af53557/14b9788af9d24f42a020631febf0c4df [2024-11-28 03:24:17,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:24:17,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:24:17,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:24:17,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:24:17,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:24:17,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c09d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17, skipping insertion in model container [2024-11-28 03:24:17,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:24:17,538 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_236e5a9b-8259-4265-a40b-18e2cefa5b20/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2024-11-28 03:24:17,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:24:17,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:24:17,621 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_236e5a9b-8259-4265-a40b-18e2cefa5b20/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2024-11-28 03:24:17,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:24:17,670 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:24:17,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17 WrapperNode [2024-11-28 03:24:17,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:24:17,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:24:17,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:24:17,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:24:17,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,719 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-28 03:24:17,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:24:17,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:24:17,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:24:17,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:24:17,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,755 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-28 03:24:17,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:24:17,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:24:17,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:24:17,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:24:17,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (1/1) ... [2024-11-28 03:24:17,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:17,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:24:17,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:24:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:24:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:24:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:24:17,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:24:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:24:17,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:24:17,987 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:24:17,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:24:20,356 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-28 03:24:20,356 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:24:20,369 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:24:20,369 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:24:20,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:20 BoogieIcfgContainer [2024-11-28 03:24:20,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:24:20,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:24:20,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:24:20,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:24:20,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:24:17" (1/3) ... [2024-11-28 03:24:20,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed3cb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:24:20, skipping insertion in model container [2024-11-28 03:24:20,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:17" (2/3) ... [2024-11-28 03:24:20,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed3cb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:24:20, skipping insertion in model container [2024-11-28 03:24:20,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:20" (3/3) ... [2024-11-28 03:24:20,388 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-62.i [2024-11-28 03:24:20,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:24:20,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-62.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:24:20,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:24:20,489 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;@3fe54828, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:24:20,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:24:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-28 03:24:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 03:24:20,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:20,507 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-28 03:24:20,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:24:20,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1942112404, now seen corresponding path program 1 times [2024-11-28 03:24:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402937317] [2024-11-28 03:24:20,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:20,546 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-28 03:24:20,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:24:20,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:24:20,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:24:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:20,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:24:20,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-28 03:24:20,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:20,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:20,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402937317] [2024-11-28 03:24:20,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402937317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:20,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:24:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981263249] [2024-11-28 03:24:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:24:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:21,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:24:21,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:24:21,019 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:24:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:21,045 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2024-11-28 03:24:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:24:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-11-28 03:24:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:21,056 INFO L225 Difference]: With dead ends: 85 [2024-11-28 03:24:21,057 INFO L226 Difference]: Without dead ends: 42 [2024-11-28 03:24:21,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-28 03:24:21,066 INFO L435 NwaCegarLoop]: 59 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, 59 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-28 03:24:21,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:24:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-28 03:24:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-28 03:24:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-28 03:24:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-28 03:24:21,132 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 91 [2024-11-28 03:24:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:21,134 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-28 03:24:21,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:24:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-28 03:24:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 03:24:21,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:21,140 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-28 03:24:21,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:24:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:24:21,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:24:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1958631132, now seen corresponding path program 1 times [2024-11-28 03:24:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575729572] [2024-11-28 03:24:21,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:21,348 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-28 03:24:21,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:24:21,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:24:21,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:24:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:21,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 03:24:21,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:25:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-28 03:25:08,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:25:40,801 WARN L286 SmtUtils]: Spent 5.67s 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-28 03:27:17,690 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse43 ((_ sign_extend 24) c_~var_1_2~0)) (.cse45 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (bvslt .cse45 (_ bv0 32))) (.cse15 (= (_ bv4 32) .cse43)) (.cse35 ((_ zero_extend 24) c_~var_1_5~0)) (.cse42 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse45)))) (.cse36 ((_ sign_extend 24) ((_ extract 7 0) .cse45))) (.cse4 (= c_~var_1_3~0 (_ bv0 8))) (.cse44 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse23 (bvslt .cse45 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse26 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse2 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse22 (not .cse23)) (.cse6 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse44) c_~var_1_14~0)))) (.cse7 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse44) c_~var_1_14~0))))) (.cse10 (not .cse4)) (.cse12 (= .cse43 .cse36)) (.cse32 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse20 (= .cse43 .cse42)) (.cse34 (= (_ bv15 32) .cse35)) (.cse17 (not .cse15)) (.cse19 (= (_ bv4 32) .cse42)) (.cse21 (not .cse11)) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0))) (and (or .cse0 (let ((.cse18 (= (_ bv4 32) .cse36)) (.cse33 (forall ((~var_1_9~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_9~0) .cse35)))) (let ((.cse13 (or .cse32 .cse33)) (.cse14 (or (not .cse32) .cse33)) (.cse30 (not .cse18)) (.cse29 (not .cse19)) (.cse16 (not .cse34))) (let ((.cse27 (and (or .cse4 (let ((.cse31 (and .cse32 .cse33))) (and (or (and .cse16 (or .cse31 .cse30) (or .cse18 .cse31) .cse15) .cse11) (or (and .cse16 .cse15 (or .cse31 .cse19) (or .cse31 .cse29)) .cse21)))) (or .cse10 (and (or .cse11 (and .cse16 (or (and .cse32 .cse12 .cse33) .cse15) (or .cse17 (and .cse32 .cse33 .cse18)))) (or (and (or .cse17 (and .cse32 .cse33 .cse19)) .cse16 (or (and .cse32 .cse20 .cse33) .cse15)) .cse21))))) (.cse28 (and .cse13 .cse14))) (let ((.cse8 (or .cse11 (and (or .cse18 .cse28) .cse16 (or .cse28 .cse30) .cse15))) (.cse9 (or (and (or .cse28 .cse19) (or .cse28 .cse29) .cse16 .cse15) .cse21)) (.cse24 (or .cse27 .cse7)) (.cse25 (or .cse27 .cse6))) (and (or .cse1 (and .cse2 (or (let ((.cse3 (or (and .cse16 (or .cse17 (and .cse13 .cse14 .cse19)) (or (and .cse20 .cse13 .cse14) .cse15)) .cse21)) (.cse5 (or .cse11 (and (or (and .cse12 .cse13 .cse14) .cse15) .cse16 (or .cse17 (and .cse13 .cse18 .cse14)))))) (and (or (and .cse3 .cse4 .cse5) .cse6) (or .cse7 (and (or (and .cse8 .cse9) .cse4) (or .cse10 (and .cse3 .cse5)))))) .cse22) (or .cse23 (and .cse24 .cse25)))) (or (and (or (and .cse8 .cse2 .cse10 .cse6 .cse9) .cse22) (or .cse23 (and .cse24 .cse2 .cse25))) .cse26))))))) (or (let ((.cse41 (and (or .cse4 (and .cse32 .cse34 .cse15)) (or .cse10 (and (or .cse11 (and .cse32 .cse34 .cse12)) (or (and .cse32 .cse20 .cse34 (or .cse17 .cse19)) .cse21)))))) (let ((.cse39 (or .cse41 .cse7)) (.cse40 (or .cse41 .cse6))) (and (or (and (or (let ((.cse37 (or .cse11 (and .cse34 .cse12))) (.cse38 (or (and .cse20 .cse34) .cse21))) (and (or (and .cse37 .cse4 .cse38) .cse6) (or .cse7 (and (or (and .cse37 .cse38) .cse10) (or .cse4 (and .cse34 .cse15)))))) .cse22) .cse2 (or .cse23 (and .cse39 .cse40))) .cse1) (or .cse26 (and (or .cse23 (and .cse2 .cse39 .cse40)) (or (and .cse34 .cse2 .cse10 .cse15 .cse6) .cse22)))))) (not .cse0)))))) is different from true [2024-11-28 03:27:54,051 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (let ((.cse19 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (= c_~var_1_3~0 (_ bv0 8))) (.cse14 (bvslt .cse19 (_ bv0 32))) (.cse20 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse20)) (.cse12 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse19))))) (.cse13 (not .cse14)) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) .cse19)))) (.cse2 (not .cse11)) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse5 (bvslt .cse19 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse0 (not .cse5))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))))))) is different from true [2024-11-28 03:28:16,501 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse2 (let ((.cse6 (= c_~var_1_3~0 (_ bv0 8))) (.cse4 ((_ sign_extend 24) c_~var_1_2~0))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse3 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse4) (bvslt .cse3 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse5 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse5 (_ bv0 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse5)))))))) (not .cse6)) (or .cse6 (= (_ bv4 32) .cse4)))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0))) .cse2) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0))) is different from true [2024-11-28 03:28:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-28 03:28:28,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:28:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575729572] [2024-11-28 03:28:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575729572] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 03:28:28,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:28:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-28 03:28:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168792594] [2024-11-28 03:28:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:28:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:28:28,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:28:28,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:28:28,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=144, Unknown=3, NotChecked=78, Total=272 [2024-11-28 03:28:28,654 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-28 03:28:29,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:36,923 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse2 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse0 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse3 (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)))) (and (or (and (or .cse0 .cse1) (or .cse0 .cse2)) .cse3) (or (let ((.cse4 (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse6 (let ((.cse10 (= c_~var_1_3~0 (_ bv0 8))) (.cse8 ((_ sign_extend 24) c_~var_1_2~0))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse7 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse7 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse7)) .cse8) (bvslt .cse7 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse9 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse9 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse9 (_ bv0 32))) (= .cse8 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse9)))))))) (not .cse10)) (or .cse10 (= (_ bv4 32) .cse8)))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse5) c_~var_1_14~0))) .cse6) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse5) c_~var_1_14~0)))) .cse6) .cse0)))) (and (or .cse4 .cse1) (or .cse4 .cse2))) .cse3))) is different from true [2024-11-28 03:28:40,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:42,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:43,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:46,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:48,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:52,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:55,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:58,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:28:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:28:58,479 INFO L93 Difference]: Finished difference Result 80 states and 111 transitions. [2024-11-28 03:28:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:28:58,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-28 03:28:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:28:58,498 INFO L225 Difference]: With dead ends: 80 [2024-11-28 03:28:58,498 INFO L226 Difference]: Without dead ends: 78 [2024-11-28 03:28:58,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=49, Invalid=145, Unknown=4, NotChecked=108, Total=306 [2024-11-28 03:28:58,500 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 46 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:28:58,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 305 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 1 Unknown, 342 Unchecked, 25.7s Time] [2024-11-28 03:28:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-28 03:28:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-11-28 03:28:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 03:28:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2024-11-28 03:28:58,521 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 91 [2024-11-28 03:28:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:28:58,522 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2024-11-28 03:28:58,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-28 03:28:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2024-11-28 03:28:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 03:28:58,524 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:28:58,524 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-28 03:28:58,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:28:58,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:28:58,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:28:58,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:28:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1960478174, now seen corresponding path program 1 times [2024-11-28 03:28:58,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:28:58,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369900742] [2024-11-28 03:28:58,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:28:58,726 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-28 03:28:58,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:28:58,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:28:58,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:28:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:28:58,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 03:28:58,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:27,174 WARN L286 SmtUtils]: Spent 5.40s 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-28 03:29:34,073 WARN L286 SmtUtils]: Spent 5.28s 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-28 03:29:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-28 03:29:44,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:31:27,679 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse36 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse12 (= (_ bv4 32) .cse36)) (.cse38 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse16 (bvslt .cse38 (_ bv0 32))) (.cse28 (not .cse12)) (.cse26 ((_ zero_extend 24) c_~var_1_5~0)) (.cse35 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse38)))) (.cse29 ((_ sign_extend 24) ((_ extract 7 0) .cse38))) (.cse9 (= c_~var_1_3~0 (_ bv0 8))) (.cse37 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse1 (bvslt .cse38 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse20 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse21 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse4 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse19 (not .cse1)) (.cse13 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse37) c_~var_1_14~0)))) (.cse5 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse37) c_~var_1_14~0))))) (.cse6 (not .cse9)) (.cse15 (= .cse36 .cse29)) (.cse23 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse17 (= .cse36 .cse35)) (.cse27 (= (_ bv15 32) .cse26)) (.cse24 (or .cse28 (= (_ bv4 32) .cse35))) (.cse18 (not .cse16)) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0))) (and (or .cse0 (let ((.cse25 ((_ zero_extend 24) c_~var_1_9~0))) (let ((.cse14 (or .cse28 (= (_ bv4 32) .cse29))) (.cse10 (or (= .cse25 (_ bv15 32)) (not .cse27))) (.cse11 (= .cse25 .cse26))) (let ((.cse22 (and (or (and .cse23 .cse11 .cse12) .cse9) (or .cse6 (and (or .cse16 (and .cse23 .cse11 .cse14 .cse15)) (or (and .cse23 .cse17 .cse24 .cse10 .cse11) .cse18)))))) (let ((.cse2 (or .cse5 .cse22)) (.cse3 (or .cse22 .cse13))) (and (or (and (or .cse1 (and .cse2 .cse3)) .cse4 (or (let ((.cse7 (or (and .cse17 .cse10 .cse11) .cse18)) (.cse8 (or (and .cse11 .cse14 .cse15) .cse16))) (and (or .cse5 (and (or .cse6 (and .cse7 .cse8)) (or .cse9 (and .cse10 .cse11 .cse12)))) (or (and .cse9 .cse7 .cse8) .cse13))) .cse19)) .cse20) (or .cse21 (and (or (and .cse10 .cse11 .cse4 .cse6 .cse12 .cse13) .cse19) (or .cse1 (and .cse4 .cse2 .cse3)))))))))) (or (let ((.cse34 (and (or .cse9 (and .cse23 .cse27 .cse12)) (or .cse6 (and (or .cse16 (and .cse23 .cse27 .cse15)) (or (and .cse23 .cse17 .cse27 .cse24) .cse18)))))) (let ((.cse32 (or .cse34 .cse5)) (.cse33 (or .cse34 .cse13))) (and (or (and (or (let ((.cse30 (or .cse16 (and .cse27 .cse15))) (.cse31 (or (and .cse17 .cse27) .cse18))) (and (or (and .cse30 .cse9 .cse31) .cse13) (or .cse5 (and (or (and .cse30 .cse31) .cse6) (or .cse9 (and .cse27 .cse12)))))) .cse19) .cse4 (or .cse1 (and .cse32 .cse33))) .cse20) (or .cse21 (and (or .cse1 (and .cse4 .cse32 .cse33)) (or (and .cse27 .cse4 .cse6 .cse12 .cse13) .cse19)))))) (not .cse0))))))) is different from true [2024-11-28 03:32:12,095 WARN L873 $PredicateComparison]: unable to prove that (or (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0) (let ((.cse19 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (= c_~var_1_3~0 (_ bv0 8))) (.cse14 (bvslt .cse19 (_ bv0 32))) (.cse20 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse20)) (.cse12 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse19))))) (.cse13 (not .cse14)) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) .cse19)))) (.cse2 (not .cse11)) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse5 (bvslt .cse19 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse0 (not .cse5))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))))))) is different from true [2024-11-28 03:32:37,070 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (let ((.cse6 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse4 ((_ sign_extend 24) c_~var_1_2~0)) (.cse7 (= c_~var_1_3~0 (_ bv0 8)))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse3 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse4) (bvslt .cse3 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse5 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse5 (_ bv0 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse5))))))) .cse6) (not .cse7)) (or (and .cse6 (= (_ bv4 32) .cse4)) .cse7)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)) (or .cse2 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)) is different from true [2024-11-28 03:32:51,984 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 21 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:32:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-28 03:32:55,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:32:55,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369900742] [2024-11-28 03:32:55,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369900742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:32:55,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:32:55,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-11-28 03:32:55,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690486707] [2024-11-28 03:32:55,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:32:55,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 03:32:55,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:32:55,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 03:32:55,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=229, Unknown=3, NotChecked=102, Total=420 [2024-11-28 03:32:55,634 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-28 03:33:22,606 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 43 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:33:27,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:33:38,108 WARN L286 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:34:10,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:34:22,763 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (= c_~var_1_3~0 (_ bv0 8)))) (let ((.cse7 (not .cse8))) (and (or (let ((.cse0 (let ((.cse2 (let ((.cse6 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse4 ((_ sign_extend 24) c_~var_1_2~0))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse3 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse4) (bvslt .cse3 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse5 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse5 (_ bv0 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse5))))))) .cse6) .cse7) (or (and .cse6 (= (_ bv4 32) .cse4)) .cse8)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)) (or .cse2 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)) (= (_ bv4 8) c_~var_1_2~0) (= (_ bv14 8) c_~var_1_1~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_14~0 .cse9) (fp.geq c_~var_1_14~0 .cse10)) (and (fp.leq c_~var_1_14~0 (fp.neg .cse10)) (fp.geq c_~var_1_14~0 (fp.neg .cse9))))) .cse7 (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-28 03:34:26,965 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse20 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse5 (bvslt .cse20 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse11 (= c_~var_1_3~0 (_ bv0 8)))) (let ((.cse2 (not .cse11)) (.cse0 (not .cse5))) (and (= (_ bv4 8) c_~var_1_2~0) (or (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0) (let ((.cse14 (bvslt .cse20 (_ bv0 32))) (.cse19 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse19)) (.cse12 (= .cse19 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse20))))) (.cse13 (not .cse14)) (.cse15 (= .cse19 ((_ sign_extend 24) ((_ extract 7 0) .cse20)))) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))))))) (= (_ bv14 8) c_~var_1_1~0) (let ((.cse22 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse21 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_14~0 .cse21) (fp.geq c_~var_1_14~0 .cse22)) (and (fp.leq c_~var_1_14~0 (fp.neg .cse22)) (fp.geq c_~var_1_14~0 (fp.neg .cse21))))) .cse2 .cse0 (= c_~var_1_14~0 c_~var_1_10~0) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-28 03:34:32,275 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse37 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse12 (= (_ bv4 32) .cse37)) (.cse39 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse1 (bvslt .cse39 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse9 (= c_~var_1_3~0 (_ bv0 8))) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (.cse16 (bvslt .cse39 (_ bv0 32))) (.cse28 (not .cse12)) (.cse26 ((_ zero_extend 24) c_~var_1_5~0)) (.cse36 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse39)))) (.cse29 ((_ sign_extend 24) ((_ extract 7 0) .cse39))) (.cse38 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse20 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse21 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse4 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse13 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse38) c_~var_1_14~0)))) (.cse5 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse38) c_~var_1_14~0))))) (.cse15 (= .cse37 .cse29)) (.cse23 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse17 (= .cse37 .cse36)) (.cse27 (= (_ bv15 32) .cse26)) (.cse24 (or .cse28 (= (_ bv4 32) .cse36))) (.cse18 (not .cse16)) (.cse30 (not .cse0)) (.cse6 (not .cse9)) (.cse19 (not .cse1))) (and (or .cse0 (let ((.cse25 ((_ zero_extend 24) c_~var_1_9~0))) (let ((.cse14 (or .cse28 (= (_ bv4 32) .cse29))) (.cse10 (or (= .cse25 (_ bv15 32)) (not .cse27))) (.cse11 (= .cse25 .cse26))) (let ((.cse22 (and (or (and .cse23 .cse11 .cse12) .cse9) (or .cse6 (and (or .cse16 (and .cse23 .cse11 .cse14 .cse15)) (or (and .cse23 .cse17 .cse24 .cse10 .cse11) .cse18)))))) (let ((.cse2 (or .cse5 .cse22)) (.cse3 (or .cse22 .cse13))) (and (or (and (or .cse1 (and .cse2 .cse3)) .cse4 (or (let ((.cse7 (or (and .cse17 .cse10 .cse11) .cse18)) (.cse8 (or (and .cse11 .cse14 .cse15) .cse16))) (and (or .cse5 (and (or .cse6 (and .cse7 .cse8)) (or .cse9 (and .cse10 .cse11 .cse12)))) (or (and .cse9 .cse7 .cse8) .cse13))) .cse19)) .cse20) (or .cse21 (and (or (and .cse10 .cse11 .cse4 .cse6 .cse12 .cse13) .cse19) (or .cse1 (and .cse4 .cse2 .cse3)))))))))) (= (_ bv4 8) c_~var_1_2~0) (fp.leq c_~var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (= (_ bv14 8) c_~var_1_1~0) .cse30 (or (let ((.cse35 (and (or .cse9 (and .cse23 .cse27 .cse12)) (or .cse6 (and (or .cse16 (and .cse23 .cse27 .cse15)) (or (and .cse23 .cse17 .cse27 .cse24) .cse18)))))) (let ((.cse33 (or .cse35 .cse5)) (.cse34 (or .cse35 .cse13))) (and (or (and (or (let ((.cse31 (or .cse16 (and .cse27 .cse15))) (.cse32 (or (and .cse17 .cse27) .cse18))) (and (or (and .cse31 .cse9 .cse32) .cse13) (or .cse5 (and (or (and .cse31 .cse32) .cse6) (or .cse9 (and .cse27 .cse12)))))) .cse19) .cse4 (or .cse1 (and .cse33 .cse34))) .cse20) (or .cse21 (and (or .cse1 (and .cse4 .cse33 .cse34)) (or (and .cse27 .cse4 .cse6 .cse12 .cse13) .cse19)))))) .cse30) (fp.geq c_~var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) .cse6 (= c_~var_1_5~0 c_~var_1_9~0) .cse19 (= c_~var_1_14~0 c_~var_1_10~0) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2024-11-28 03:34:36,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:44,793 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse5 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse9 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse11 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0))) (and (or (let ((.cse0 (let ((.cse4 (let ((.cse7 ((_ sign_extend 24) c_~var_1_2~0)) (.cse10 (= c_~var_1_3~0 (_ bv0 8)))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse6 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse6 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse6)) .cse7) (bvslt .cse6 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse8 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse8 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse8 (_ bv0 32))) (= .cse7 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse8))))))) .cse9) (not .cse10)) (or (and .cse9 (= (_ bv4 32) .cse7)) .cse10)))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse3) c_~var_1_14~0)))) .cse4) .cse5 (or .cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse3) c_~var_1_14~0)))))))) (and (or .cse0 .cse1) (or .cse0 .cse2))) .cse11) (or (and (or .cse5 .cse2) (or (and .cse5 .cse9) .cse1)) .cse11))) is different from true [2024-11-28 03:34:46,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:34:51,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:34:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:58,199 INFO L93 Difference]: Finished difference Result 168 states and 226 transitions. [2024-11-28 03:34:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 03:34:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 91 [2024-11-28 03:34:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:58,211 INFO L225 Difference]: With dead ends: 168 [2024-11-28 03:34:58,211 INFO L226 Difference]: Without dead ends: 166 [2024-11-28 03:34:58,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 88.0s TimeCoverageRelationStatistics Valid=204, Invalid=519, Unknown=7, NotChecked=392, Total=1122 [2024-11-28 03:34:58,213 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 194 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 817 IncrementalHoareTripleChecker+Unchecked, 67.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:58,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 359 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 500 Invalid, 0 Unknown, 817 Unchecked, 67.5s Time] [2024-11-28 03:34:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-28 03:34:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 124. [2024-11-28 03:34:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 79 states have internal predecessors, (93), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-28 03:34:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2024-11-28 03:34:58,252 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 91 [2024-11-28 03:34:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:58,252 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2024-11-28 03:34:58,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-28 03:34:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2024-11-28 03:34:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-28 03:34:58,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:58,254 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-28 03:34:58,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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)] Ended with exit code 0 [2024-11-28 03:34:58,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:34:58,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:58,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -561328802, now seen corresponding path program 1 times [2024-11-28 03:34:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:34:58,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793397176] [2024-11-28 03:34:58,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:58,456 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-28 03:34:58,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:34:58,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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-28 03:34:58,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236e5a9b-8259-4265-a40b-18e2cefa5b20/bin/uautomizer-verify-aQ6SnzHsRB/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 (5)] Waiting until timeout for monitored process [2024-11-28 03:34:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:58,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 03:34:58,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-28 03:35:58,772 INFO L312 TraceCheckSpWp]: Computing backward predicates...