./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:21:23,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:21:23,363 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:21:23,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:21:23,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:21:23,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:21:23,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:21:23,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:21:23,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:21:23,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:21:23,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:21:23,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:21:23,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:21:23,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:21:23,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:21:23,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:21:23,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:21:23,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:21:23,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:21:23,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:21:23,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:21:23,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:21:23,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:21:23,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:21:23,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:21:23,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:21:23,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:21:23,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:21:23,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:21:23,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:21:23,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:21:23,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:21:23,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:21:23,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:21:23,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:21:23,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:21:23,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:21:23,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:21:23,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:21:23,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:21:23,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:21:23,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:21:23,413 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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 -> 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d [2024-11-13 14:21:23,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:21:23,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:21:23,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:21:23,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:21:23,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:21:23,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i Unable to find full path for "g++" [2024-11-13 14:21:25,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:21:25,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:21:25,902 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2024-11-13 14:21:25,912 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/data/f936e4bc2/3f22975e6c6e45e38adf6ff0b5670664/FLAG68fe3020b [2024-11-13 14:21:26,222 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/data/f936e4bc2/3f22975e6c6e45e38adf6ff0b5670664 [2024-11-13 14:21:26,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:21:26,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:21:26,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:21:26,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:21:26,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:21:26,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3274dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26, skipping insertion in model container [2024-11-13 14:21:26,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:21:26,429 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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2024-11-13 14:21:26,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:21:26,454 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:21:26,467 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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2024-11-13 14:21:26,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:21:26,485 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:21:26,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26 WrapperNode [2024-11-13 14:21:26,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:21:26,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:21:26,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:21:26,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:21:26,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,520 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 24 [2024-11-13 14:21:26,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:21:26,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:21:26,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:21:26,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:21:26,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,544 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 14:21:26,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:21:26,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:21:26,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:21:26,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:21:26,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (1/1) ... [2024-11-13 14:21:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:21:26,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:26,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:21:26,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:21:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:21:26,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:21:26,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:21:26,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:21:26,702 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:21:26,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:21:26,822 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-13 14:21:26,822 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:21:26,833 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:21:26,833 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:21:26,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:21:26 BoogieIcfgContainer [2024-11-13 14:21:26,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:21:26,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:21:26,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:21:26,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:21:26,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:21:26" (1/3) ... [2024-11-13 14:21:26,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbec127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:21:26, skipping insertion in model container [2024-11-13 14:21:26,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:26" (2/3) ... [2024-11-13 14:21:26,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbec127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:21:26, skipping insertion in model container [2024-11-13 14:21:26,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:21:26" (3/3) ... [2024-11-13 14:21:26,844 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div.i [2024-11-13 14:21:26,861 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:21:26,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div.i that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:21:26,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:21:26,947 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;@6c2530ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:21:26,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:21:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:21:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 14:21:26,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:26,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:21:26,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:21:26,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash 889603051, now seen corresponding path program 1 times [2024-11-13 14:21:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17118332] [2024-11-13 14:21:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:21:27,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:21:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:21:27,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:21:27,085 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:21:27,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:21:27,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:21:27,094 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 14:21:27,106 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:21:27,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:21:27 BoogieIcfgContainer [2024-11-13 14:21:27,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:21:27,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:21:27,110 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:21:27,111 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:21:27,111 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:21:26" (3/4) ... [2024-11-13 14:21:27,114 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:21:27,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:21:27,116 INFO L158 Benchmark]: Toolchain (without parser) took 890.35ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 58.6MB in the end (delta: 34.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:21:27,116 INFO L158 Benchmark]: CDTParser took 0.30ms. 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 14:21:27,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.16ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 82.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:21:27,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:21:27,117 INFO L158 Benchmark]: Boogie Preprocessor took 37.81ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:21:27,118 INFO L158 Benchmark]: RCFGBuilder took 273.41ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 71.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:21:27,118 INFO L158 Benchmark]: TraceAbstraction took 273.61ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 58.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:21:27,119 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 58.6MB in the end (delta: 273.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:21:27,121 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.30ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.16ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 82.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.81ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 273.41ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 71.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 273.61ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 58.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 58.6MB in the end (delta: 273.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 21, overapproximation of someBinaryDOUBLEComparisonOperation at line 29, overapproximation of someBinaryDOUBLEComparisonOperation at line 23. Possible FailurePath: [L20] double x = 1.0; [L21] double x1 = x/2.5; [L23] COND FALSE !(x1 != x) [L29] CALL __VERIFIER_assert(x == 0) [L13] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 14:21:27,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:21:29,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:21:29,988 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:21:30,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:21:30,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:21:30,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:21:30,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:21:30,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:21:30,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:21:30,040 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:21:30,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:21:30,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:21:30,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:21:30,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:21:30,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:21:30,042 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:21:30,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:21:30,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:21:30,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:21:30,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:21:30,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:21:30,045 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:21:30,045 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:21:30,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:21:30,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:21:30,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:21:30,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:21:30,045 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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 -> 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d [2024-11-13 14:21:30,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:21:30,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:21:30,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:21:30,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:21:30,419 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:21:30,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i Unable to find full path for "g++" [2024-11-13 14:21:32,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:21:32,696 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:21:32,697 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2024-11-13 14:21:32,705 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/data/952a72ecc/f4016600624a43a89f5d05ee36dbc203/FLAG9a6a63c51 [2024-11-13 14:21:32,731 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/data/952a72ecc/f4016600624a43a89f5d05ee36dbc203 [2024-11-13 14:21:32,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:21:32,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:21:32,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:21:32,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:21:32,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:21:32,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:21:32" (1/1) ... [2024-11-13 14:21:32,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3250a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:32, skipping insertion in model container [2024-11-13 14:21:32,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:21:32" (1/1) ... [2024-11-13 14:21:32,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:21:32,939 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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2024-11-13 14:21:32,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:21:32,972 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:21:32,985 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_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2024-11-13 14:21:32,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:21:33,012 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:21:33,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33 WrapperNode [2024-11-13 14:21:33,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:21:33,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:21:33,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:21:33,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:21:33,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,052 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25 [2024-11-13 14:21:33,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:21:33,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:21:33,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:21:33,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:21:33,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,083 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 14:21:33,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:21:33,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:21:33,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:21:33,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:21:33,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (1/1) ... [2024-11-13 14:21:33,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:21:33,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:33,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:21:33,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:21:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:21:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:21:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:21:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:21:33,234 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:21:33,236 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:21:33,989 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-13 14:21:33,989 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:21:33,999 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:21:33,999 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:21:33,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:21:33 BoogieIcfgContainer [2024-11-13 14:21:34,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:21:34,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:21:34,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:21:34,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:21:34,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:21:32" (1/3) ... [2024-11-13 14:21:34,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25777c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:21:34, skipping insertion in model container [2024-11-13 14:21:34,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:21:33" (2/3) ... [2024-11-13 14:21:34,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25777c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:21:34, skipping insertion in model container [2024-11-13 14:21:34,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:21:33" (3/3) ... [2024-11-13 14:21:34,014 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div.i [2024-11-13 14:21:34,030 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:21:34,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div.i that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:21:34,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:21:34,096 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;@5eeac855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:21:34,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:21:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:21:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 14:21:34,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:34,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:21:34,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:21:34,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 889603051, now seen corresponding path program 1 times [2024-11-13 14:21:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:21:34,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399002662] [2024-11-13 14:21:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:34,124 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:21:34,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:21:34,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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:21:34,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:21:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:34,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:21:34,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:21:35,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:21:35,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:21:35,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399002662] [2024-11-13 14:21:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399002662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:35,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:21:35,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520444599] [2024-11-13 14:21:35,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:35,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:21:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:21:35,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:21:35,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:21:35,263 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:21:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:38,158 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-13 14:21:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:21:38,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 14:21:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:38,167 INFO L225 Difference]: With dead ends: 20 [2024-11-13 14:21:38,167 INFO L226 Difference]: Without dead ends: 8 [2024-11-13 14:21:38,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:21:38,175 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:38,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 14 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:21:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-13 14:21:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-13 14:21:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:21:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-11-13 14:21:38,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2024-11-13 14:21:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:38,221 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-11-13 14:21:38,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:21:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-11-13 14:21:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 14:21:38,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:38,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:21:38,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:21:38,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:21:38,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:21:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1809556175, now seen corresponding path program 1 times [2024-11-13 14:21:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:21:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002755534] [2024-11-13 14:21:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:38,424 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:21:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:21:38,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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:21:38,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:21:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:38,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:21:38,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:21:40,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:59,952 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:22:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:22:00,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:22:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002755534] [2024-11-13 14:22:00,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002755534] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:22:00,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:22:00,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-13 14:22:00,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343353597] [2024-11-13 14:22:00,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:22:00,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:22:00,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:22:00,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:22:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2024-11-13 14:22:00,933 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:07,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:22:09,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:22:13,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:22:17,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:22:21,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:22:25,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:22:29,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:22:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:22:29,647 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-11-13 14:22:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:22:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-13 14:22:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:22:29,670 INFO L225 Difference]: With dead ends: 14 [2024-11-13 14:22:29,670 INFO L226 Difference]: Without dead ends: 10 [2024-11-13 14:22:29,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=33, Invalid=56, Unknown=1, NotChecked=0, Total=90 [2024-11-13 14:22:29,671 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:22:29,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 27.1s Time] [2024-11-13 14:22:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-13 14:22:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-13 14:22:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-13 14:22:29,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2024-11-13 14:22:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:22:29,676 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-13 14:22:29,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:22:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-13 14:22:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 14:22:29,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:22:29,680 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2024-11-13 14:22:29,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:22:29,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:22:29,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:22:29,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:22:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -424978865, now seen corresponding path program 2 times [2024-11-13 14:22:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:22:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890088718] [2024-11-13 14:22:29,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:22:29,883 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:22:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:22:29,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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:22:29,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 14:22:30,510 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:22:30,510 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:22:30,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:22:30,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:22:42,965 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:22:47,051 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 14:22:55,901 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:23:01,046 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:23:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-13 14:23:01,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:23:07,798 WARN L286 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:23:41,366 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:23:50,045 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-13 14:23:54,098 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:24:02,490 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:24:10,790 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:24:14,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-13 14:24:18,982 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:24:27,599 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:24:36,048 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:24:40,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-13 14:24:44,292 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-13 14:24:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-13 14:24:44,293 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:24:44,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890088718] [2024-11-13 14:24:44,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890088718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:24:44,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:24:44,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2024-11-13 14:24:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614055939] [2024-11-13 14:24:44,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:24:44,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:24:44,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:24:44,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:24:44,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=51, Unknown=11, NotChecked=90, Total=182 [2024-11-13 14:24:44,295 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:24:48,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 14:24:52,501 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 14:24:56,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 14:25:00,683 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:25:04,760 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:25:08,870 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:25:32,144 WARN L286 SmtUtils]: Spent 9.39s on a formula simplification. DAG size of input: 22 DAG size of output: 16 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:25:33,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:25:37,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:25:40,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:01,355 WARN L286 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:26:03,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:05,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:09,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:21,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:22,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:35,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:39,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:43,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:47,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:26:59,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:27:03,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:27:07,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:27:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:27:07,766 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-13 14:27:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:27:07,792 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-13 14:27:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:27:07,793 INFO L225 Difference]: With dead ends: 19 [2024-11-13 14:27:07,793 INFO L226 Difference]: Without dead ends: 13 [2024-11-13 14:27:07,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 152.3s TimeCoverageRelationStatistics Valid=63, Invalid=129, Unknown=26, NotChecked=288, Total=506 [2024-11-13 14:27:07,795 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 54.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:27:07,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 10 Unknown, 103 Unchecked, 54.1s Time] [2024-11-13 14:27:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-13 14:27:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-13 14:27:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:27:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-13 14:27:07,800 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2024-11-13 14:27:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:27:07,800 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-13 14:27:07,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:27:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-13 14:27:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 14:27:07,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:27:07,802 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2024-11-13 14:27:07,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:27:08,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:27:08,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:27:08,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:27:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash -287777557, now seen corresponding path program 3 times [2024-11-13 14:27:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:27:08,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711146252] [2024-11-13 14:27:08,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:27:08,003 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:27:08,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:27:08,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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:27:08,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:27:08,815 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 14:27:08,815 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:27:08,837 WARN L253 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:27:08,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:27:39,038 WARN L286 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:27:47,545 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:28:18,328 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:28:27,959 WARN L286 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:28:32,789 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:28:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 4 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-13 14:28:33,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:28:44,555 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from true [2024-11-13 14:28:52,738 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:29:00,989 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:29:05,605 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:29:14,035 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:29:22,365 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:29:26,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-13 14:29:30,570 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:29:39,207 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:29:47,885 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:29:52,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-13 14:29:56,173 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:30:04,888 WARN L286 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:30:13,614 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:30:17,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-13 14:30:21,981 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-13 14:30:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-13 14:30:21,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:30:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711146252] [2024-11-13 14:30:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711146252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:30:21,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:30:21,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2024-11-13 14:30:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400147653] [2024-11-13 14:30:21,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:30:21,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:30:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:30:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:30:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=66, Unknown=14, NotChecked=126, Total=240 [2024-11-13 14:30:21,984 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:30:26,299 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 14:30:30,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 14:30:34,548 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:30:38,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 14:30:42,735 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:30:46,820 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:30:51,003 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:30:55,464 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:30:57,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:31:01,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:31:03,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:31:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:03,197 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-13 14:31:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:31:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 14:31:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:03,198 INFO L225 Difference]: With dead ends: 17 [2024-11-13 14:31:03,198 INFO L226 Difference]: Without dead ends: 13 [2024-11-13 14:31:03,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 127.6s TimeCoverageRelationStatistics Valid=46, Invalid=70, Unknown=22, NotChecked=324, Total=462 [2024-11-13 14:31:03,199 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:03,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 115 Unchecked, 7.8s Time] [2024-11-13 14:31:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-13 14:31:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-13 14:31:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:31:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-13 14:31:03,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2024-11-13 14:31:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:03,210 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-13 14:31:03,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:31:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-13 14:31:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 14:31:03,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:03,210 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:03,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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:31:03,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:31:03,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:03,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1623033493, now seen corresponding path program 4 times [2024-11-13 14:31:03,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:31:03,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547583115] [2024-11-13 14:31:03,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 14:31:03,412 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:31:03,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:31:03,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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:31:03,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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)] Waiting until timeout for monitored process [2024-11-13 14:31:04,502 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 14:31:04,502 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:31:04,534 WARN L253 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:31:04,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:31:20,274 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:31:24,358 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) is different from false [2024-11-13 14:31:28,447 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) is different from true [2024-11-13 14:31:36,761 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:31:40,895 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0))) is different from false [2024-11-13 14:31:45,039 WARN L873 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0))) is different from true [2024-11-13 14:31:53,485 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:31:57,693 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0))) is different from false [2024-11-13 14:32:01,904 WARN L873 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0))) is different from true [2024-11-13 14:32:10,393 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:32:14,714 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) is different from false [2024-11-13 14:32:19,032 WARN L873 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) is different from true [2024-11-13 14:32:28,160 WARN L286 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:32:36,746 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:32:41,039 WARN L851 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.div currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)))) is different from false [2024-11-13 14:32:45,193 WARN L873 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.div currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)))) is different from true [2024-11-13 14:32:57,989 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:33:02,247 WARN L851 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2024-11-13 14:33:06,399 WARN L873 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2024-11-13 14:33:19,147 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:33:31,889 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:33:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2024-11-13 14:33:31,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:33:56,590 WARN L286 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:34:00,664 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2024-11-13 14:34:09,310 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:34:13,406 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2024-11-13 14:34:17,499 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2024-11-13 14:34:25,798 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:34:29,949 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2024-11-13 14:34:34,094 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2024-11-13 14:34:42,453 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:34:46,634 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2024-11-13 14:34:50,828 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2024-11-13 14:34:59,254 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:35:03,506 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2024-11-13 14:35:07,738 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2024-11-13 14:35:20,525 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:35:24,685 WARN L851 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (not (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-13 14:35:28,956 WARN L873 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (not (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-13 14:35:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2024-11-13 14:35:28,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:35:28,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547583115] [2024-11-13 14:35:28,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547583115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:35:28,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:35:28,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2024-11-13 14:35:28,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375417130] [2024-11-13 14:35:28,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:35:28,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:35:28,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:35:28,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:35:28,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=20, Unknown=24, NotChecked=228, Total=306 [2024-11-13 14:35:28,959 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:33,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)))) is different from false [2024-11-13 14:35:37,647 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)))) is different from true [2024-11-13 14:35:41,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)))) is different from false [2024-11-13 14:35:46,081 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))) (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)))) is different from true [2024-11-13 14:35:50,344 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from false [2024-11-13 14:35:54,935 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (not (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0) .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from true [2024-11-13 14:35:59,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from false [2024-11-13 14:36:03,329 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2024-11-13 14:36:07,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from false [2024-11-13 14:36:11,921 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) is different from true [2024-11-13 14:36:16,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)))) is different from false [2024-11-13 14:36:23,288 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.div currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)))) (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|))) is different from false [2024-11-13 14:36:25,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:36:29,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:36:31,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:36:34,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:36:36,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:36:40,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:36:41,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:36:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:36:41,598 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-13 14:36:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:36:41,647 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 14:36:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:36:41,647 INFO L225 Difference]: With dead ends: 18 [2024-11-13 14:36:41,647 INFO L226 Difference]: Without dead ends: 14 [2024-11-13 14:36:41,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 174.0s TimeCoverageRelationStatistics Valid=48, Invalid=22, Unknown=36, NotChecked=494, Total=600 [2024-11-13 14:36:41,652 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:36:41,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 2 Unknown, 189 Unchecked, 18.5s Time] [2024-11-13 14:36:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-13 14:36:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-13 14:36:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-13 14:36:41,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2024-11-13 14:36:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:36:41,664 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-13 14:36:41,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:36:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-13 14:36:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 14:36:41,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:36:41,666 INFO L215 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2024-11-13 14:36:41,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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)] Ended with exit code 0 [2024-11-13 14:36:41,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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 14:36:41,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:36:41,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:36:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1227234639, now seen corresponding path program 5 times [2024-11-13 14:36:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:36:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542060378] [2024-11-13 14:36:41,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 14:36:41,868 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:36:41,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:36:41,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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:36:41,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_491bc9e6-e7c5-48d8-87b0-1cd727d5ffd4/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:36:43,787 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-13 14:36:43,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:36:43,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:36:43,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:36:58,382 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true