./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:40:44,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:40:44,387 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 00:40:44,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:40:44,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:40:44,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:40:44,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:40:44,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:40:44,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:40:44,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:40:44,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:40:44,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:40:44,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:40:44,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:40:44,432 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:40:44,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:40:44,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:40:44,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:40:44,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:40:44,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:40:44,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:40:44,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:40:44,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:40:44,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:40:44,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:40:44,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:40:44,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:40:44,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:40:44,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:40:44,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:40:44,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:40:44,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:40:44,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:40:44,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:40:44,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:40:44,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:40:44,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:40:44,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:40:44,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:40:44,436 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_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2024-11-24 00:40:44,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:40:44,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:40:44,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:40:44,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:40:44,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:40:44,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/loop-1.c [2024-11-24 00:40:47,680 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data/95e71bf0a/07ff9b4ccee3461ca71bc1c4ac142d93/FLAGce7e822f4 [2024-11-24 00:40:47,955 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:40:47,960 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/sv-benchmarks/c/float-benchs/loop-1.c [2024-11-24 00:40:47,971 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data/95e71bf0a/07ff9b4ccee3461ca71bc1c4ac142d93/FLAGce7e822f4 [2024-11-24 00:40:48,016 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data/95e71bf0a/07ff9b4ccee3461ca71bc1c4ac142d93 [2024-11-24 00:40:48,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:40:48,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:40:48,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:40:48,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:40:48,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:40:48,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706aef42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48, skipping insertion in model container [2024-11-24 00:40:48,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:40:48,207 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_4e923658-b6f3-400c-8b9f-c5004c202d82/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2024-11-24 00:40:48,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:40:48,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:40:48,240 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_4e923658-b6f3-400c-8b9f-c5004c202d82/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2024-11-24 00:40:48,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:40:48,257 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:40:48,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48 WrapperNode [2024-11-24 00:40:48,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:40:48,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:40:48,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:40:48,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:40:48,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,291 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2024-11-24 00:40:48,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:40:48,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:40:48,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:40:48,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:40:48,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,316 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-24 00:40:48,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:40:48,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:40:48,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:40:48,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:40:48,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (1/1) ... [2024-11-24 00:40:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:40:48,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:40:48,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:40:48,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:40:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:40:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:40:48,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:40:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:40:48,459 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:40:48,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:40:48,554 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-24 00:40:48,554 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:40:48,561 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:40:48,562 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 00:40:48,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:40:48 BoogieIcfgContainer [2024-11-24 00:40:48,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:40:48,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:40:48,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:40:48,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:40:48,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:40:48" (1/3) ... [2024-11-24 00:40:48,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cff06ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:40:48, skipping insertion in model container [2024-11-24 00:40:48,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:48" (2/3) ... [2024-11-24 00:40:48,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cff06ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:40:48, skipping insertion in model container [2024-11-24 00:40:48,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:40:48" (3/3) ... [2024-11-24 00:40:48,574 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-1.c [2024-11-24 00:40:48,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:40:48,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-1.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 00:40:48,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:40:48,677 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;@26a37721, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:40:48,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:40:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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-24 00:40:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-24 00:40:48,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:40:48,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 00:40:48,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:40:48,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:40:48,698 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times [2024-11-24 00:40:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:40:48,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853089969] [2024-11-24 00:40:48,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:40:48,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:40:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:40:48,805 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:40:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:40:48,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:40:48,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:40:48,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 00:40:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:40:48,846 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-24 00:40:48,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:40:48,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:40:48 BoogieIcfgContainer [2024-11-24 00:40:48,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:40:48,865 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:40:48,866 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:40:48,866 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:40:48,866 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:40:48" (3/4) ... [2024-11-24 00:40:48,869 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:40:48,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:40:48,871 INFO L158 Benchmark]: Toolchain (without parser) took 848.91ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 59.6MB in the end (delta: 34.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:40:48,872 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 167.8MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:40:48,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.64ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 83.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:40:48,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.19ms. Allocated memory is still 117.4MB. Free memory was 83.6MB in the beginning and 82.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:40:48,873 INFO L158 Benchmark]: Boogie Preprocessor took 41.74ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 81.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:40:48,873 INFO L158 Benchmark]: RCFGBuilder took 227.45ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 72.2MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:40:48,873 INFO L158 Benchmark]: TraceAbstraction took 301.27ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 60.0MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:40:48,874 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 117.4MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:40:48,876 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.28ms. Allocated memory is still 167.8MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.64ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 83.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.19ms. Allocated memory is still 117.4MB. Free memory was 83.6MB in the beginning and 82.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.74ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 81.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 227.45ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 72.2MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 301.27ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 60.0MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 117.4MB. Free memory is still 59.6MB. 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: 4]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 14, overapproximation of someBinaryFLOATComparisonOperation at line 20, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f [L14] COND FALSE !(x < y) [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) [L4] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 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=12occurred 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:40:48,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:40:51,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:40:51,721 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 00:40:51,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:40:51,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:40:51,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:40:51,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:40:51,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:40:51,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:40:51,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:40:51,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:40:51,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:40:51,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:40:51,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:40:51,783 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:40:51,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:40:51,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:40:51,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:40:51,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:40:51,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:40:51,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:40:51,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:40:51,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:40:51,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:40:51,785 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:40:51,785 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:40:51,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:40:51,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:40:51,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:40:51,785 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:40:51,786 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:40:51,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:40:51,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:40:51,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:40:51,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:40:51,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:40:51,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:40:51,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:40:51,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:40:51,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:40:51,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:40:51,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:40:51,788 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_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2024-11-24 00:40:52,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:40:52,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:40:52,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:40:52,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:40:52,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:40:52,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/loop-1.c [2024-11-24 00:40:55,121 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data/378e9c99b/1bd94f4467264e229bad79cd27740d84/FLAGfed08653f [2024-11-24 00:40:55,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:40:55,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/sv-benchmarks/c/float-benchs/loop-1.c [2024-11-24 00:40:55,360 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data/378e9c99b/1bd94f4467264e229bad79cd27740d84/FLAGfed08653f [2024-11-24 00:40:55,383 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/data/378e9c99b/1bd94f4467264e229bad79cd27740d84 [2024-11-24 00:40:55,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:40:55,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:40:55,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:40:55,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:40:55,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:40:55,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ad73f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55, skipping insertion in model container [2024-11-24 00:40:55,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:40:55,573 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_4e923658-b6f3-400c-8b9f-c5004c202d82/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2024-11-24 00:40:55,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:40:55,610 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:40:55,623 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_4e923658-b6f3-400c-8b9f-c5004c202d82/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2024-11-24 00:40:55,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:40:55,650 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:40:55,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55 WrapperNode [2024-11-24 00:40:55,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:40:55,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:40:55,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:40:55,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:40:55,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,690 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2024-11-24 00:40:55,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:40:55,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:40:55,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:40:55,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:40:55,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,724 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-24 00:40:55,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:40:55,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:40:55,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:40:55,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:40:55,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (1/1) ... [2024-11-24 00:40:55,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:40:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:40:55,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:40:55,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:40:55,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:40:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:40:55,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:40:55,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:40:55,876 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:40:55,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:40:56,392 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-24 00:40:56,392 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:40:56,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:40:56,403 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 00:40:56,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:40:56 BoogieIcfgContainer [2024-11-24 00:40:56,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:40:56,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:40:56,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:40:56,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:40:56,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:40:55" (1/3) ... [2024-11-24 00:40:56,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5bf29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:40:56, skipping insertion in model container [2024-11-24 00:40:56,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:40:55" (2/3) ... [2024-11-24 00:40:56,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5bf29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:40:56, skipping insertion in model container [2024-11-24 00:40:56,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:40:56" (3/3) ... [2024-11-24 00:40:56,416 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-1.c [2024-11-24 00:40:56,433 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:40:56,435 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-1.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 00:40:56,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:40:56,507 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;@58059b42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:40:56,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:40:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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-24 00:40:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-24 00:40:56,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:40:56,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 00:40:56,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:40:56,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:40:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times [2024-11-24 00:40:56,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:40:56,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471534318] [2024-11-24 00:40:56,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:40:56,532 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-24 00:40:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:40:56,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:40:56,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:40:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:40:56,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:40:56,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:40:56,709 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-24 00:40:56,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:40:56,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:40:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471534318] [2024-11-24 00:40:56,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471534318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:40:56,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:40:56,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:40:56,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081008485] [2024-11-24 00:40:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:40:56,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:40:56,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:40:56,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:40:56,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:40:56,747 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) Second operand has 3 states, 3 states have (on average 2.0) 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-24 00:40:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:40:57,300 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-24 00:40:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:40:57,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) 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-24 00:40:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:40:57,309 INFO L225 Difference]: With dead ends: 22 [2024-11-24 00:40:57,309 INFO L226 Difference]: Without dead ends: 10 [2024-11-24 00:40:57,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:40:57,316 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-24 00:40:57,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-24 00:40:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-24 00:40:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-24 00:40:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-24 00:40:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-24 00:40:57,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-24 00:40:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:40:57,349 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-24 00:40:57,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) 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-24 00:40:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-24 00:40:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-24 00:40:57,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:40:57,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:40:57,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-24 00:40:57,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:40:57,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:40:57,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:40:57,551 INFO L85 PathProgramCache]: Analyzing trace with hash 207982255, now seen corresponding path program 1 times [2024-11-24 00:40:57,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:40:57,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367890679] [2024-11-24 00:40:57,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:40:57,552 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-24 00:40:57,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:40:57,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:40:57,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:40:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:40:57,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-24 00:40:57,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:40:57,797 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-24 00:40:57,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:41:03,754 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-24 00:41:03,754 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:41:03,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367890679] [2024-11-24 00:41:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367890679] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 00:41:03,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 00:41:03,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-24 00:41:03,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34353394] [2024-11-24 00:41:03,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 00:41:03,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:41:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:41:03,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:41:03,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:41:03,757 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-24 00:41:08,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:41:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:41:13,965 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-24 00:41:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:41:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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) Word has length 8 [2024-11-24 00:41:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:41:13,971 INFO L225 Difference]: With dead ends: 19 [2024-11-24 00:41:13,971 INFO L226 Difference]: Without dead ends: 15 [2024-11-24 00:41:13,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:41:13,972 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-24 00:41:13,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-24 00:41:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-24 00:41:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-24 00:41:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-24 00:41:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-24 00:41:13,981 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-24 00:41:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:41:13,981 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-24 00:41:13,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-24 00:41:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-24 00:41:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-24 00:41:13,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:41:13,983 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-24 00:41:13,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:41:14,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:41:14,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:41:14,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:41:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -858744965, now seen corresponding path program 2 times [2024-11-24 00:41:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:41:14,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956367999] [2024-11-24 00:41:14,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:41:14,185 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-24 00:41:14,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:41:14,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:41:14,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:41:14,467 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 00:41:14,468 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:41:14,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-24 00:41:14,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:41:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:41:17,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:42:00,617 WARN L286 SmtUtils]: Spent 7.55s 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-24 00:42:04,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) is different from false [2024-11-24 00:42:08,651 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) is different from true [2024-11-24 00:42:14,811 WARN L286 SmtUtils]: Spent 6.16s 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-24 00:42:22,853 WARN L286 SmtUtils]: Spent 8.04s 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-24 00:42:26,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2024-11-24 00:42:30,903 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2024-11-24 00:42:38,951 WARN L286 SmtUtils]: Spent 8.05s 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-24 00:42:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2024-11-24 00:42:38,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:42:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956367999] [2024-11-24 00:42:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956367999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 00:42:38,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 00:42:38,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-24 00:42:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276984431] [2024-11-24 00:42:38,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 00:42:38,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 00:42:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:42:38,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 00:42:38,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=69, Unknown=6, NotChecked=38, Total=156 [2024-11-24 00:42:38,970 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-24 00:42:41,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:42:46,002 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:43:23,078 WARN L286 SmtUtils]: Spent 9.65s 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-24 00:43:26,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:43:32,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:43:34,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:43:44,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:43:46,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:43:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:43:46,299 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-24 00:43:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:43:46,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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 14 [2024-11-24 00:43:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:43:46,304 INFO L225 Difference]: With dead ends: 27 [2024-11-24 00:43:46,304 INFO L226 Difference]: Without dead ends: 23 [2024-11-24 00:43:46,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 98.6s TimeCoverageRelationStatistics Valid=85, Invalid=130, Unknown=7, NotChecked=84, Total=306 [2024-11-24 00:43:46,306 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-24 00:43:46,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 18 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 56 Unchecked, 16.6s Time] [2024-11-24 00:43:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-24 00:43:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-24 00:43:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-24 00:43:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-24 00:43:46,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 14 [2024-11-24 00:43:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:43:46,312 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-24 00:43:46,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-24 00:43:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-24 00:43:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-24 00:43:46,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:43:46,313 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2024-11-24 00:43:46,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:43:46,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:43:46,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:43:46,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:43:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1187900043, now seen corresponding path program 3 times [2024-11-24 00:43:46,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:43:46,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537941835] [2024-11-24 00:43:46,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 00:43:46,519 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-24 00:43:46,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:43:46,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:43:46,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e923658-b6f3-400c-8b9f-c5004c202d82/bin/uautomizer-verify-LYvppIcaGC/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-24 00:43:47,279 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-24 00:43:47,280 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:43:47,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-24 00:43:47,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:44:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:44:32,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:46:03,777 WARN L286 SmtUtils]: Spent 13.66s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 00:46:11,865 WARN L286 SmtUtils]: Spent 8.09s 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-24 00:46:19,936 WARN L286 SmtUtils]: Spent 8.07s 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-24 00:46:28,017 WARN L286 SmtUtils]: Spent 8.08s 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-24 00:46:32,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)))))) is different from false [2024-11-24 00:46:42,683 WARN L286 SmtUtils]: Spent 6.76s 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-24 00:46:50,753 WARN L286 SmtUtils]: Spent 8.07s 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-24 00:46:58,844 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:47:06,949 WARN L286 SmtUtils]: Spent 8.10s 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-24 00:47:14,155 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2024-11-24 00:47:22,291 WARN L286 SmtUtils]: Spent 8.13s 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-24 00:47:30,403 WARN L286 SmtUtils]: Spent 8.11s 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-24 00:47:38,517 WARN L286 SmtUtils]: Spent 8.11s 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-24 00:47:46,619 WARN L286 SmtUtils]: Spent 8.10s 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-24 00:47:50,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from false [2024-11-24 00:47:54,681 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6))))))) is different from true [2024-11-24 00:48:02,777 WARN L286 SmtUtils]: Spent 8.09s 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-24 00:48:10,875 WARN L286 SmtUtils]: Spent 8.10s 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-24 00:48:18,961 WARN L286 SmtUtils]: Spent 8.09s 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-24 00:48:27,052 WARN L286 SmtUtils]: Spent 8.09s 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-24 00:48:35,197 WARN L286 SmtUtils]: Spent 8.14s 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-24 00:48:43,330 WARN L286 SmtUtils]: Spent 8.13s 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-24 00:48:51,440 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:48:59,601 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:49:03,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2024-11-24 00:49:07,671 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4)) (.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse1 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse0 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2024-11-24 00:49:15,777 WARN L286 SmtUtils]: Spent 8.10s 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-24 00:49:23,885 WARN L286 SmtUtils]: Spent 8.11s 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-24 00:49:31,996 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:49:40,113 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:49:48,263 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:49:56,410 WARN L286 SmtUtils]: Spent 8.15s 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-24 00:50:04,570 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:50:12,805 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:50:16,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2024-11-24 00:50:20,890 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2024-11-24 00:50:29,017 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:50:37,145 WARN L286 SmtUtils]: Spent 8.13s 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-24 00:50:45,281 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:50:53,483 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:51:01,659 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:51:09,837 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:51:18,009 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:51:26,175 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:51:30,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from false [2024-11-24 00:51:34,276 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6))))))) is different from true [2024-11-24 00:51:42,437 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:51:50,602 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:51:58,771 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:52:06,925 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:52:15,138 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:52:23,372 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:52:31,589 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:52:39,774 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:52:43,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from false [2024-11-24 00:52:47,876 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3) .cse3) .cse3) .cse3)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3) .cse3) .cse3) .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse2 .cse4))))))) is different from true [2024-11-24 00:52:56,071 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:53:04,276 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:53:12,448 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:53:20,619 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:53:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 60 not checked. [2024-11-24 00:53:20,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:53:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537941835] [2024-11-24 00:53:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537941835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 00:53:20,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 00:53:20,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2024-11-24 00:53:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237969843] [2024-11-24 00:53:20,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 00:53:20,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 00:53:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:53:20,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 00:53:20,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=183, Unknown=17, NotChecked=252, Total=552 [2024-11-24 00:53:20,675 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:53:23,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 00:53:26,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 00:53:30,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:53:34,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:53:38,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:53:41,773 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-24 00:53:45,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:53:49,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-24 00:53:53,315 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse3 .cse4)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:53:57,375 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4)) (.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)))))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse4 .cse4)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:54:03,532 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0)) (.cse6 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:54:07,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))))) is different from false [2024-11-24 00:54:11,607 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0)) (.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)))))))) is different from true [2024-11-24 00:54:15,647 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse5) .cse5) .cse5) .cse5) |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse5) .cse5) .cse5) .cse5)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:55:00,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:55:45,510 WARN L286 SmtUtils]: Spent 16.59s on a formula simplification. DAG size of input: 17 DAG size of output: 15 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 00:55:49,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:55:53,565 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-24 00:56:09,108 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 00:56:12,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:56:14,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:56:17,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:56:21,976 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 []