./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:50:32,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:50:32,639 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:50:32,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:50:32,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:50:32,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:50:32,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:50:32,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:50:32,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:50:32,670 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:50:32,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:50:32,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:50:32,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:50:32,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:50:32,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:50:32,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:50:32,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:50:32,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:50:32,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:50:32,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:50:32,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:50:32,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:50:32,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:50:32,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:50:32,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:50:32,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:50:32,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:50:32,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:50:32,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:50:32,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:50:32,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:50:32,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:50:32,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:50:32,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:50:32,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:50:32,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:50:32,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:50:32,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:50:32,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:50:32,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:50:32,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:50:32,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:50:32,674 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_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2024-11-13 13:50:32,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:50:32,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:50:32,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:50:32,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:50:32,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:50:33,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i Unable to find full path for "g++" [2024-11-13 13:50:34,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:50:35,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:50:35,208 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2024-11-13 13:50:35,220 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/data/2f9ba5d68/71b6dcaaa04e40228389e3d0eb022bb6/FLAG77f425a26 [2024-11-13 13:50:35,515 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/data/2f9ba5d68/71b6dcaaa04e40228389e3d0eb022bb6 [2024-11-13 13:50:35,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:50:35,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:50:35,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:50:35,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:50:35,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:50:35,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5a77dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35, skipping insertion in model container [2024-11-13 13:50:35,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:50:35,756 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_b687e214-df4f-41a0-85b7-d255e304372e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2024-11-13 13:50:35,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:50:35,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:50:35,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2024-11-13 13:50:35,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:50:35,861 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:50:35,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35 WrapperNode [2024-11-13 13:50:35,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:50:35,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:50:35,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:50:35,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:50:35,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,911 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-11-13 13:50:35,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:50:35,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:50:35,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:50:35,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:50:35,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,935 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:50:35,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:50:35,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:50:35,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:50:35,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:50:35,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (1/1) ... [2024-11-13 13:50:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:50:35,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:50:35,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:50:35,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:50:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:50:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:50:36,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:50:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:50:36,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:50:36,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:50:36,129 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:50:36,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:50:36,418 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-13 13:50:36,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:50:36,432 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:50:36,433 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:50:36,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:50:36 BoogieIcfgContainer [2024-11-13 13:50:36,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:50:36,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:50:36,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:50:36,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:50:36,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:50:35" (1/3) ... [2024-11-13 13:50:36,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e78747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:50:36, skipping insertion in model container [2024-11-13 13:50:36,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:35" (2/3) ... [2024-11-13 13:50:36,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e78747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:50:36, skipping insertion in model container [2024-11-13 13:50:36,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:50:36" (3/3) ... [2024-11-13 13:50:36,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2024-11-13 13:50:36,467 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:50:36,471 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-46.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:50:36,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:50:36,582 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;@47aa4a11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:50:36,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:50:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 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-13 13:50:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 13:50:36,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:36,605 INFO L215 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] [2024-11-13 13:50:36,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:36,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash -300635202, now seen corresponding path program 1 times [2024-11-13 13:50:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:50:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673444593] [2024-11-13 13:50:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:50:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:50:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:50:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:50:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 13:50:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:50:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 13:50:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 13:50:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:50:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:50:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:50:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:50:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:50:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:50:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 13:50:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:37,011 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-13 13:50:37,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:50:37,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673444593] [2024-11-13 13:50:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673444593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:37,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:50:37,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52043485] [2024-11-13 13:50:37,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:37,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:50:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:50:37,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:50:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:50:37,052 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 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-13 13:50:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:37,083 INFO L93 Difference]: Finished difference Result 83 states and 134 transitions. [2024-11-13 13:50:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:50:37,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 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 90 [2024-11-13 13:50:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:37,096 INFO L225 Difference]: With dead ends: 83 [2024-11-13 13:50:37,096 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 13:50:37,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:50:37,104 INFO L432 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:37,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:50:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 13:50:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-13 13:50:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-13 13:50:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-11-13 13:50:37,186 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 90 [2024-11-13 13:50:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:37,188 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-11-13 13:50:37,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 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-13 13:50:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-11-13 13:50:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 13:50:37,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:37,194 INFO L215 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] [2024-11-13 13:50:37,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:50:37,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:37,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash 358132342, now seen corresponding path program 1 times [2024-11-13 13:50:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:50:37,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413566030] [2024-11-13 13:50:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:50:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:50:37,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:50:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:50:37,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:50:37,512 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:50:37,514 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:50:37,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:50:37,521 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 13:50:37,587 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:50:37,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:50:37 BoogieIcfgContainer [2024-11-13 13:50:37,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:50:37,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:50:37,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:50:37,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:50:37,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:50:36" (3/4) ... [2024-11-13 13:50:37,594 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:50:37,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:50:37,596 INFO L158 Benchmark]: Toolchain (without parser) took 2076.51ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 76.1MB in the end (delta: 16.8MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-13 13:50:37,596 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:50:37,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.76ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 80.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:50:37,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.66ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:50:37,597 INFO L158 Benchmark]: Boogie Preprocessor took 35.81ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:50:37,598 INFO L158 Benchmark]: RCFGBuilder took 484.42ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 65.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:50:37,598 INFO L158 Benchmark]: TraceAbstraction took 1153.48ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 76.7MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:50:37,598 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 76.1MB in the end (delta: 553.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:50:37,600 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.64ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.76ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 80.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.66ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.81ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 484.42ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 65.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1153.48ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 76.7MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 76.1MB in the end (delta: 553.2kB). 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 someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 255.3; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 1000000000000.5; [L25] double var_1_4 = 999999999.125; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 100; [L28] signed long int var_1_7 = 256; [L29] signed long int var_1_8 = -5; [L30] double var_1_9 = 24.2; [L31] double var_1_10 = -0.125; [L32] double var_1_11 = -0.5; VAL [isInitial=0, var_1_1=2553/10, var_1_2=0, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L78] isInitial = 1 [L79] FCALL initially() [L80] COND TRUE 1 [L81] FCALL updateLastVariables() [L82] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L50] var_1_3 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L51] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L52] var_1_4 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L53] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L60] var_1_7 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L61] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L63] var_1_8 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L64] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L82] RET updateVariables() [L83] CALL step() [L36] signed long int stepLocal_0 = (((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)); VAL [isInitial=1, stepLocal_0=4, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, stepLocal_0=4, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L44] var_1_11 = var_1_3 VAL [isInitial=1, stepLocal_0=4, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L83] RET step() [L84] CALL, EXPR property() [L74-L75] return (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7))) < var_1_8) ? (var_1_1 == ((double) (var_1_9 + var_1_10))) : 1)) && (var_1_11 == ((double) var_1_3)) ; VAL [\result=0, isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L84] RET, EXPR property() [L84] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L19] reach_error() VAL [isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, 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, 56 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, 56 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 13:50:37,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:50:40,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:50:40,820 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:50:40,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:50:40,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:50:40,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:50:40,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:50:40,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:50:40,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:50:40,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:50:40,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:50:40,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:50:40,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:50:40,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:50:40,910 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:50:40,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:50:40,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:50:40,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:50:40,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:50:40,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:50:40,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:50:40,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:50:40,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:50:40,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:50:40,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:50:40,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:50:40,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:50:40,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:50:40,913 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:50:40,913 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:50:40,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:50:40,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:50:40,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:50:40,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:50:40,914 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_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2024-11-13 13:50:41,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:50:41,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:50:41,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:50:41,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:50:41,281 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:50:41,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i Unable to find full path for "g++" [2024-11-13 13:50:43,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:50:43,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:50:43,632 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2024-11-13 13:50:43,648 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/data/5e0aa1b90/01a4e95e6c8941c686e1ee064b483b6b/FLAGdae311ad5 [2024-11-13 13:50:43,672 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/data/5e0aa1b90/01a4e95e6c8941c686e1ee064b483b6b [2024-11-13 13:50:43,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:50:43,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:50:43,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:50:43,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:50:43,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:50:43,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:50:43" (1/1) ... [2024-11-13 13:50:43,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0f6463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:43, skipping insertion in model container [2024-11-13 13:50:43,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:50:43" (1/1) ... [2024-11-13 13:50:43,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:50:43,911 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_b687e214-df4f-41a0-85b7-d255e304372e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2024-11-13 13:50:43,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:50:44,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:50:44,026 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_b687e214-df4f-41a0-85b7-d255e304372e/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2024-11-13 13:50:44,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:50:44,096 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:50:44,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44 WrapperNode [2024-11-13 13:50:44,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:50:44,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:50:44,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:50:44,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:50:44,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,165 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-13 13:50:44,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:50:44,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:50:44,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:50:44,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:50:44,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:50:44,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:50:44,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:50:44,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:50:44,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:50:44,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (1/1) ... [2024-11-13 13:50:44,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:50:44,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:50:44,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:50:44,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:50:44,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:50:44,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:50:44,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:50:44,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:50:44,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:50:44,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:50:44,377 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:50:44,379 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:50:44,954 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-13 13:50:44,955 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:50:44,970 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:50:44,972 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:50:44,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:50:44 BoogieIcfgContainer [2024-11-13 13:50:44,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:50:44,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:50:44,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:50:44,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:50:44,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:50:43" (1/3) ... [2024-11-13 13:50:44,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75467938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:50:44, skipping insertion in model container [2024-11-13 13:50:44,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:44" (2/3) ... [2024-11-13 13:50:44,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75467938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:50:44, skipping insertion in model container [2024-11-13 13:50:44,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:50:44" (3/3) ... [2024-11-13 13:50:44,989 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2024-11-13 13:50:45,010 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:50:45,014 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-46.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:50:45,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:50:45,101 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;@64d6bba8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:50:45,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:50:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 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-13 13:50:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 13:50:45,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:45,120 INFO L215 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] [2024-11-13 13:50:45,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:45,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash -300635202, now seen corresponding path program 1 times [2024-11-13 13:50:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:45,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595714100] [2024-11-13 13:50:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:45,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:45,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:45,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:45,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 13:50:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:45,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:50:45,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:45,540 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-13 13:50:45,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:45,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:45,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595714100] [2024-11-13 13:50:45,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595714100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:45,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:45,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:50:45,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201282893] [2024-11-13 13:50:45,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:50:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:50:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:50:45,571 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 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.5) internal successors, (27), 2 states have internal predecessors, (27), 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-13 13:50:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:45,593 INFO L93 Difference]: Finished difference Result 83 states and 134 transitions. [2024-11-13 13:50:45,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:50:45,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 90 [2024-11-13 13:50:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:45,600 INFO L225 Difference]: With dead ends: 83 [2024-11-13 13:50:45,600 INFO L226 Difference]: Without dead ends: 41 [2024-11-13 13:50:45,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:50:45,608 INFO L432 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:45,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:50:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-13 13:50:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-13 13:50:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-13 13:50:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-11-13 13:50:45,668 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 90 [2024-11-13 13:50:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:45,668 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-11-13 13:50:45,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-13 13:50:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-11-13 13:50:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 13:50:45,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:45,673 INFO L215 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] [2024-11-13 13:50:45,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 13:50:45,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:45,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:45,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 358132342, now seen corresponding path program 1 times [2024-11-13 13:50:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630432843] [2024-11-13 13:50:45,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:45,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:45,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:45,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 13:50:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:46,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 13:50:46,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:51:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 60 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-13 13:51:09,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:52:02,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:52:02,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630432843] [2024-11-13 13:52:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630432843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:52:02,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067668454] [2024-11-13 13:52:02,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:02,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:52:02,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:52:02,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:52:02,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:52:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:02,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 13:52:02,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:53:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 78 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-13 13:53:09,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:53:36,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067668454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:53:36,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:53:36,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2024-11-13 13:53:36,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832387624] [2024-11-13 13:53:36,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:53:36,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:53:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:53:36,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:53:36,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=630, Unknown=2, NotChecked=0, Total=756 [2024-11-13 13:53:36,116 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-13 13:53:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:53:47,377 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-13 13:53:47,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:53:47,380 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 90 [2024-11-13 13:53:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:53:47,384 INFO L225 Difference]: With dead ends: 60 [2024-11-13 13:53:47,385 INFO L226 Difference]: Without dead ends: 58 [2024-11-13 13:53:47,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 105.6s TimeCoverageRelationStatistics Valid=202, Invalid=852, Unknown=2, NotChecked=0, Total=1056 [2024-11-13 13:53:47,388 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:53:47,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 270 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-13 13:53:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-13 13:53:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-11-13 13:53:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 13:53:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-11-13 13:53:47,405 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 90 [2024-11-13 13:53:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:53:47,406 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-11-13 13:53:47,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-13 13:53:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-11-13 13:53:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 13:53:47,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:53:47,408 INFO L215 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-13 13:53:47,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:53:47,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 13:53:47,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:53:47,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:53:47,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:53:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash -66959736, now seen corresponding path program 1 times [2024-11-13 13:53:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:53:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649091303] [2024-11-13 13:53:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:53:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:53:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:53:47,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:53:47,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 13:53:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:53:48,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 13:53:48,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 105 proven. 33 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-13 13:55:03,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:55,555 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse6 (= (_ bv0 8) c_~var_1_2~0)) (.cse1 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse16 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse7 (fp.eq c_~var_1_11~0 c_~var_1_3~0))) (let ((.cse11 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse14 (bvslt c_~var_1_5~0 c_~var_1_8~0)) (.cse15 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (.cse17 (or .cse1 .cse16 .cse7)) (.cse3 (not .cse6)) (.cse4 (not (bvslt c_~var_1_7~0 c_~var_1_8~0))) (.cse18 (or .cse19 .cse6)) (.cse9 (bvslt c_~var_1_6~0 c_~var_1_8~0))) (let ((.cse5 (not .cse9)) (.cse10 (and .cse17 (or .cse3 (and (or .cse19 .cse4) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse4))) .cse18)) (.cse8 (and .cse17 .cse18)) (.cse0 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse12 (and (or .cse15 .cse16 .cse7) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse6))) (.cse2 (not .cse14)) (.cse13 (not .cse11))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse5 .cse3 .cse4) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse6) (or .cse1 .cse7))) (or (and (or .cse8 .cse9) (or .cse5 .cse10)) .cse11) (or (and (or .cse12 .cse5) (or .cse12 .cse9)) .cse11) (or .cse13 (and (or .cse2 .cse10) (or .cse14 .cse8))) (or .cse0 (and (or .cse15 .cse7) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse6))) (or (and (or .cse12 .cse14) (or .cse12 .cse2)) .cse13))))) is different from true [2024-11-13 13:56:19,370 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse13 (= (_ bv0 8) c_~var_1_2~0)) (.cse10 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse18 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse14 (or .cse10 .cse18)) (.cse11 (not .cse13)) (.cse12 (not (bvslt c_~var_1_7~0 c_~var_1_8~0))) (.cse16 (or .cse17 .cse13)) (.cse2 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse6 (bvslt c_~var_1_5~0 c_~var_1_8~0)) (.cse0 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse18))) (let ((.cse1 (and .cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse13))) (.cse4 (not .cse0)) (.cse5 (not .cse6)) (.cse9 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse3 (not .cse2)) (.cse8 (and .cse14 (or .cse11 (and (or .cse17 .cse12) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse12))) .cse16)) (.cse7 (and .cse14 .cse16))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse3 .cse1))) (or .cse4 (and (or .cse5 .cse1) (or .cse6 .cse1))) (or .cse4 (and (or .cse6 .cse7) (or .cse5 .cse8))) (or .cse9 (and (or .cse10 .cse5 .cse11 .cse12) (or .cse10 .cse3 .cse11 .cse12) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse13) .cse14)) (or .cse9 (and .cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse13))) (or .cse0 (and (or .cse3 .cse8) (or .cse7 .cse2))))))) is different from true [2024-11-13 13:56:45,575 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse1 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse11 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse4 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse13)) (.cse7 (= (_ bv0 8) c_~var_1_2~0))) (let ((.cse0 (and .cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse7))) (.cse8 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse12 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse6 (not .cse7)) (.cse9 (or .cse4 .cse13)) (.cse3 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse14 (or .cse11 .cse7)) (.cse10 (not .cse1)) (.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (and (or .cse0 .cse1) (or .cse2 (and (or .cse3 .cse4 .cse5 .cse6) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse7) (or .cse4 .cse5 .cse8 .cse6) .cse9)) (or .cse10 .cse0) (or (and (or (and (or .cse11 .cse5 .cse8) (or .cse12 .cse5 .cse8)) .cse6) (or .cse4 .cse13 .cse8) (or .cse11 .cse8 .cse7) .cse9 .cse14) .cse1) (or (and (or (and (or .cse3 .cse11 .cse5) (or .cse12 .cse3 .cse5)) .cse6) (or .cse3 .cse11 .cse7) .cse9 (or .cse3 .cse4 .cse13) .cse14) .cse10) (or .cse2 (and .cse15 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse7))))))) is different from true [2024-11-13 13:58:06,152 WARN L286 SmtUtils]: Spent 32.11s on a formula simplification. DAG size of input: 48 DAG size of output: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:58:35,793 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:58:35,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649091303] [2024-11-13 13:58:35,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649091303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:58:35,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509308932] [2024-11-13 13:58:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:58:35,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:58:35,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:58:35,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:58:35,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:58:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:58:36,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 13:58:36,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:01:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 114 proven. 54 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-13 14:01:24,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:02:09,556 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse4 (not (bvslt c_~var_1_7~0 c_~var_1_8~0))) (.cse6 (= (_ bv0 8) c_~var_1_2~0)) (.cse10 (bvslt c_~var_1_5~0 c_~var_1_8~0)) (.cse1 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse12 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse13 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse14 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (.cse18 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse7 (fp.eq c_~var_1_11~0 c_~var_1_3~0))) (let ((.cse9 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse11 (or .cse14 .cse18 .cse7)) (.cse0 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (not .cse13)) (.cse8 (not .cse12)) (.cse16 (or .cse1 .cse18 .cse7)) (.cse2 (not .cse10)) (.cse3 (not .cse6)) (.cse17 (and (or .cse15 .cse4) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse4)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse5 .cse3 .cse4) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse6) (or .cse1 .cse7))) (or .cse8 (and (or (and (or .cse2 .cse9) (or .cse10 .cse9)) .cse6) .cse11)) (or .cse12 (and (or (and (or .cse5 .cse9) (or .cse9 .cse13)) .cse6) .cse11)) (or .cse0 (and (or .cse14 .cse7) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse6))) (or .cse12 (and (or (and (or .cse15 .cse13) (or .cse5 .cse15)) .cse6) .cse16 (or .cse5 .cse3 .cse17))) (or .cse8 (and .cse16 (or (and (or .cse10 .cse15) (or .cse2 .cse15)) .cse6) (or .cse2 .cse3 .cse17)))))) is different from true [2024-11-13 14:02:32,295 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse16 (fp.eq c_~var_1_3~0 c_~var_1_3~0)) (.cse4 (= (_ bv0 8) c_~var_1_2~0)) (.cse11 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse3 (bvslt c_~var_1_5~0 c_~var_1_8~0)) (.cse6 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse15 (not (bvslt c_~var_1_7~0 c_~var_1_8~0))) (.cse12 (bvslt c_~var_1_5~0 c_~var_1_6~0))) (let ((.cse0 (not .cse12)) (.cse2 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse8 (and (or .cse6 .cse15) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse15))) (.cse1 (not .cse3)) (.cse10 (not .cse11)) (.cse7 (not .cse4)) (.cse9 (or .cse14 .cse16)) (.cse13 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse16))) (and (or .cse0 (and (or (and (or .cse1 .cse2) (or .cse3 .cse2)) .cse4) .cse5)) (or .cse0 (and (or (and (or .cse3 .cse6) (or .cse1 .cse6)) .cse4) (or .cse1 .cse7 .cse8) .cse9)) (or (and (or (and (or .cse10 .cse2) (or .cse2 .cse11)) .cse4) .cse5) .cse12) (or .cse12 (and (or (and (or .cse6 .cse11) (or .cse10 .cse6)) .cse4) (or .cse10 .cse7 .cse8) .cse9)) (or .cse13 (and (or .cse14 .cse1 .cse7 .cse15) (or .cse14 .cse10 .cse7 .cse15) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse4) .cse9)) (or .cse13 (and .cse5 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse4)))))) is different from true [2024-11-13 14:02:53,795 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse11 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse4 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse1 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse14 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse15)) (.cse7 (= (_ bv0 8) c_~var_1_2~0))) (let ((.cse0 (and .cse14 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) .cse7))) (.cse8 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse10 (not .cse1)) (.cse12 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (not (fp.eq ~var_1_1~0 ~var_1_4~0)) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse3 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse5 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse6 (not .cse7)) (.cse9 (or .cse4 .cse15)) (.cse13 (or .cse11 .cse7)) (.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (and (or .cse0 .cse1) (or .cse2 (and (or .cse3 .cse4 .cse5 .cse6) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse7) (or .cse4 .cse5 .cse8 .cse6) .cse9)) (or .cse10 .cse0) (or .cse1 (and (or (and (or .cse11 .cse5 .cse8) (or .cse12 .cse5 .cse8)) .cse6) .cse9 .cse13)) (or .cse10 (and (or (and (or .cse3 .cse11 .cse5) (or .cse12 .cse3 .cse5)) .cse6) .cse9 .cse13)) (or .cse2 (and .cse14 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) .cse7))))))) is different from true [2024-11-13 14:04:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509308932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:04:19,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:04:19,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2024-11-13 14:04:19,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714546001] [2024-11-13 14:04:19,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:04:19,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 14:04:19,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:19,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 14:04:19,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=496, Unknown=14, NotChecked=306, Total=930 [2024-11-13 14:04:19,242 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-13 14:04:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:04:39,733 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2024-11-13 14:04:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:04:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 91 [2024-11-13 14:04:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:04:39,740 INFO L225 Difference]: With dead ends: 66 [2024-11-13 14:04:39,740 INFO L226 Difference]: Without dead ends: 64 [2024-11-13 14:04:39,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 230.1s TimeCoverageRelationStatistics Valid=170, Invalid=710, Unknown=14, NotChecked=366, Total=1260 [2024-11-13 14:04:39,747 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:04:39,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 276 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-13 14:04:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-13 14:04:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2024-11-13 14:04:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:04:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-11-13 14:04:39,777 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 91 [2024-11-13 14:04:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:04:39,777 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-11-13 14:04:39,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-13 14:04:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-11-13 14:04:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 14:04:39,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:04:39,786 INFO L215 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-13 14:04:39,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 14:04:40,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:04:40,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:40,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:04:40,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash -124218038, now seen corresponding path program 1 times [2024-11-13 14:04:40,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:40,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861703457] [2024-11-13 14:04:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:40,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:04:40,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:04:40,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:04:40,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687e214-df4f-41a0-85b7-d255e304372e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 14:04:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:40,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:04:40,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 178 proven. 27 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-13 14:05:15,886 INFO L311 TraceCheckSpWp]: Computing backward predicates...