./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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 8dd2b259de573dae381590d9c9a53c821e05ecea3ef79b47acb4a28edd56bf9a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:26:25,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:26:25,230 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 00:26:25,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:26:25,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:26:25,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:26:25,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:26:25,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:26:25,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:26:25,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:26:25,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:26:25,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:26:25,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:26:25,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:26:25,276 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:26:25,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:26:25,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:26:25,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:26:25,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:26:25,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:26:25,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:26:25,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:26:25,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:26:25,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:26:25,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:26:25,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:26:25,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:26:25,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:26:25,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:26:25,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:26:25,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:26:25,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:26:25,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:26:25,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:26:25,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:26:25,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:26:25,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:26:25,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:26:25,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:26:25,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:26:25,286 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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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 -> 8dd2b259de573dae381590d9c9a53c821e05ecea3ef79b47acb4a28edd56bf9a [2024-11-24 00:26:25,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:26:25,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:26:25,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:26:25,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:26:25,709 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:26:25,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2024-11-24 00:26:29,295 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data/85987e71e/4168679cffae4f54882e9ec0a9ca7208/FLAG510c0fa46 [2024-11-24 00:26:29,592 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:26:29,593 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2024-11-24 00:26:29,600 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data/85987e71e/4168679cffae4f54882e9ec0a9ca7208/FLAG510c0fa46 [2024-11-24 00:26:29,616 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data/85987e71e/4168679cffae4f54882e9ec0a9ca7208 [2024-11-24 00:26:29,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:26:29,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:26:29,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:26:29,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:26:29,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:26:29,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:29,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fe8ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29, skipping insertion in model container [2024-11-24 00:26:29,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:29,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:26:29,874 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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c[674,687] [2024-11-24 00:26:29,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:26:29,903 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:26:29,918 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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c[674,687] [2024-11-24 00:26:29,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:26:29,936 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:26:29,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29 WrapperNode [2024-11-24 00:26:29,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:26:29,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:26:29,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:26:29,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:26:29,951 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:26:29" (1/1) ... [2024-11-24 00:26:29,959 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:26:29" (1/1) ... [2024-11-24 00:26:29,981 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2024-11-24 00:26:29,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:26:29,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:26:29,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:26:29,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:26:29,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:29,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:29,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,016 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:26:30,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:26:30,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:26:30,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:26:30,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:26:30,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (1/1) ... [2024-11-24 00:26:30,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:26:30,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:26:30,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:30,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:26:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:26:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:26:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:26:30,193 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:26:30,196 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:26:30,309 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-24 00:26:30,309 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:26:30,320 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:26:30,320 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:26:30,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:26:30 BoogieIcfgContainer [2024-11-24 00:26:30,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:26:30,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:26:30,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:26:30,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:26:30,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:26:29" (1/3) ... [2024-11-24 00:26:30,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b73175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:26:30, skipping insertion in model container [2024-11-24 00:26:30,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:29" (2/3) ... [2024-11-24 00:26:30,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b73175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:26:30, skipping insertion in model container [2024-11-24 00:26:30,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:26:30" (3/3) ... [2024-11-24 00:26:30,337 INFO L128 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2024-11-24 00:26:30,357 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:26:30,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div_bad.i.p+cfa-reducer.c that has 1 procedures, 9 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-24 00:26:30,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:26:30,458 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;@42a86998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:26:30,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:26:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:26:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-24 00:26:30,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:26:30,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-24 00:26:30,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:26:30,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:26:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2024-11-24 00:26:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:26:30,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785878581] [2024-11-24 00:26:30,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:26:30,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:26:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:26:30,607 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:26:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:26:30,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:26:30,643 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:26:30,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 00:26:30,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:26:30,657 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-24 00:26:30,685 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:26:30,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:26:30 BoogieIcfgContainer [2024-11-24 00:26:30,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:26:30,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:26:30,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:26:30,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:26:30,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:26:30" (3/4) ... [2024-11-24 00:26:30,699 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:26:30,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:26:30,702 INFO L158 Benchmark]: Toolchain (without parser) took 1080.38ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 83.1MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-24 00:26:30,702 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:26:30,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.91ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 106.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:26:30,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.68ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 105.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:26:30,704 INFO L158 Benchmark]: Boogie Preprocessor took 48.88ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 104.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:26:30,706 INFO L158 Benchmark]: RCFGBuilder took 285.68ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 95.7MB in the end (delta: 8.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 00:26:30,706 INFO L158 Benchmark]: TraceAbstraction took 366.22ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 83.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:26:30,706 INFO L158 Benchmark]: Witness Printer took 7.95ms. Allocated memory is still 142.6MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:26:30,710 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.52ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.91ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 106.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.68ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 105.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.88ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 104.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 285.68ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 95.7MB in the end (delta: 8.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 366.22ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 83.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 7.95ms. Allocated memory is still 142.6MB. Free memory is still 83.1MB. 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: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 10, overapproximation of someBinaryDOUBLEComparisonOperation at line 12. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x = 1.0; [L10] double main__x1 = main__x / 1.6; VAL [__return_main=0] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L27] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 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=9occurred 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, 5 NumberOfCodeBlocks, 5 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:26:30,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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 8dd2b259de573dae381590d9c9a53c821e05ecea3ef79b47acb4a28edd56bf9a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:26:33,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:26:34,114 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 00:26:34,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:26:34,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:26:34,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:26:34,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:26:34,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:26:34,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:26:34,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:26:34,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:26:34,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:26:34,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:26:34,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:26:34,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:26:34,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:26:34,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:26:34,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:26:34,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:26:34,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:26:34,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:26:34,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:26:34,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:26:34,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:26:34,174 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:26:34,174 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:26:34,174 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:26:34,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:26:34,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:26:34,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:26:34,175 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:26:34,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:26:34,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:26:34,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:26:34,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:26:34,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:26:34,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:26:34,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:26:34,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:26:34,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:26:34,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:26:34,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:26:34,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:26:34,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:26:34,179 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:26:34,179 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:26:34,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:26:34,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:26:34,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:26:34,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:26:34,180 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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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 -> 8dd2b259de573dae381590d9c9a53c821e05ecea3ef79b47acb4a28edd56bf9a [2024-11-24 00:26:34,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:26:34,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:26:34,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:26:34,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:26:34,557 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:26:34,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2024-11-24 00:26:38,275 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data/5cf8c7290/ee8f64b528384242bea32de14d9369c2/FLAGcd8b2d9ec [2024-11-24 00:26:38,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:26:38,610 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2024-11-24 00:26:38,620 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data/5cf8c7290/ee8f64b528384242bea32de14d9369c2/FLAGcd8b2d9ec [2024-11-24 00:26:38,862 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/data/5cf8c7290/ee8f64b528384242bea32de14d9369c2 [2024-11-24 00:26:38,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:26:38,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:26:38,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:26:38,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:26:38,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:26:38,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:26:38" (1/1) ... [2024-11-24 00:26:38,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24352e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:38, skipping insertion in model container [2024-11-24 00:26:38,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:26:38" (1/1) ... [2024-11-24 00:26:38,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:26:39,092 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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c[674,687] [2024-11-24 00:26:39,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:26:39,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:26:39,137 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_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c[674,687] [2024-11-24 00:26:39,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:26:39,164 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:26:39,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39 WrapperNode [2024-11-24 00:26:39,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:26:39,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:26:39,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:26:39,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:26:39,181 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:26:39" (1/1) ... [2024-11-24 00:26:39,193 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:26:39" (1/1) ... [2024-11-24 00:26:39,214 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2024-11-24 00:26:39,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:26:39,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:26:39,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:26:39,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:26:39,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,241 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:26:39,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:26:39,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:26:39,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:26:39,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:26:39,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (1/1) ... [2024-11-24 00:26:39,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:26:39,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:26:39,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:39,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:26:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:26:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:26:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:26:39,429 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:26:39,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:26:44,947 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-24 00:26:44,947 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:26:44,958 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:26:44,958 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:26:44,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:26:44 BoogieIcfgContainer [2024-11-24 00:26:44,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:26:44,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:26:44,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:26:44,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:26:44,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:26:38" (1/3) ... [2024-11-24 00:26:44,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e457c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:26:44, skipping insertion in model container [2024-11-24 00:26:44,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:26:39" (2/3) ... [2024-11-24 00:26:44,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e457c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:26:44, skipping insertion in model container [2024-11-24 00:26:44,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:26:44" (3/3) ... [2024-11-24 00:26:44,971 INFO L128 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2024-11-24 00:26:44,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:26:44,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div_bad.i.p+cfa-reducer.c that has 1 procedures, 9 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-24 00:26:45,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:26:45,083 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;@6c659620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:26:45,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:26:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:26:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-24 00:26:45,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:26:45,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-24 00:26:45,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:26:45,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:26:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2024-11-24 00:26:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:26:45,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238787267] [2024-11-24 00:26:45,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:26:45,113 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:26:45,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:26:45,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:45,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:26:46,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:26:46,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:26:46,921 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:26:46,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:26:46,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:26:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238787267] [2024-11-24 00:26:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238787267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:26:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:26:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:26:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358884986] [2024-11-24 00:26:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:26:46,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:26:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:26:46,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:26:46,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:26:46,955 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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:26:52,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:26:53,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:26:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:26:53,976 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-24 00:26:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:26:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-24 00:26:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:26:54,007 INFO L225 Difference]: With dead ends: 16 [2024-11-24 00:26:54,007 INFO L226 Difference]: Without dead ends: 7 [2024-11-24 00:26:54,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:26:54,013 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-24 00:26:54,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-24 00:26:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-11-24 00:26:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-24 00:26:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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:26:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-11-24 00:26:54,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-11-24 00:26:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:26:54,049 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-11-24 00:26:54,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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:26:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-11-24 00:26:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-24 00:26:54,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:26:54,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 00:26:54,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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)] Forceful destruction successful, exit code 0 [2024-11-24 00:26:54,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:54,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:26:54,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:26:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2024-11-24 00:26:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:26:54,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398676558] [2024-11-24 00:26:54,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:26:54,253 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:26:54,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:26:54,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:54,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:26:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:26:56,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-24 00:26:56,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:27:02,902 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:27:02,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:27:14,059 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true [2024-11-24 00:27:22,329 WARN L286 SmtUtils]: Spent 8.27s 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:27:26,453 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2024-11-24 00:27:30,577 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2024-11-24 00:27:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-24 00:27:30,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:27:30,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398676558] [2024-11-24 00:27:30,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398676558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 00:27:30,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 00:27:30,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-24 00:27:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297301617] [2024-11-24 00:27:30,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 00:27:30,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:27:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:27:30,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:27:30,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=20, Unknown=3, NotChecked=18, Total=56 [2024-11-24 00:27:30,582 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:27:34,741 WARN L873 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-24 00:27:46,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:27:48,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:27:50,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:27:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:27:50,409 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-11-24 00:27:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:27:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-24 00:27:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:27:50,411 INFO L225 Difference]: With dead ends: 12 [2024-11-24 00:27:50,411 INFO L226 Difference]: Without dead ends: 9 [2024-11-24 00:27:50,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=27, Invalid=37, Unknown=4, NotChecked=42, Total=110 [2024-11-24 00:27:50,413 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-24 00:27:50,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 20 Unchecked, 5.5s Time] [2024-11-24 00:27:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-24 00:27:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-24 00:27:50,416 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:27:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-24 00:27:50,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-24 00:27:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:27:50,417 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-24 00:27:50,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:27:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-24 00:27:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-24 00:27:50,418 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:27:50,418 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2024-11-24 00:27:50,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:27:50,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:27:50,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:27:50,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:27:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 2 times [2024-11-24 00:27:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:27:50,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834699624] [2024-11-24 00:27:50,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:27:50,621 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:27:50,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:27:50,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:27:50,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:27:54,177 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 00:27:54,177 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:27:54,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-24 00:27:54,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:28:04,408 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:28:08,614 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-24 00:28:17,910 WARN L286 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:28:37,785 WARN L286 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 00:28:48,018 WARN L286 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:28:54,612 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:28:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-24 00:28:54,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:29:01,683 WARN L286 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:29:08,918 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2024-11-24 00:29:17,429 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:29:25,851 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:29:29,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-24 00:29:34,172 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-24 00:29:43,138 WARN L286 SmtUtils]: Spent 8.96s 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:29:51,847 WARN L286 SmtUtils]: Spent 8.71s 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:29:56,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-24 00:30:00,347 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-24 00:30:09,895 WARN L286 SmtUtils]: Spent 9.55s 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:30:19,024 WARN L286 SmtUtils]: Spent 9.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:30:23,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-24 00:30:27,785 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-24 00:30:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-24 00:30:27,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:30:27,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834699624] [2024-11-24 00:30:27,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834699624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 00:30:27,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 00:30:27,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-11-24 00:30:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579890340] [2024-11-24 00:30:27,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 00:30:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 00:30:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:30:27,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 00:30:27,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2024-11-24 00:30:27,789 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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:30:32,261 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-24 00:30:36,548 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:30:43,998 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:30:48,595 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:31:06,262 WARN L286 SmtUtils]: Spent 10.80s on a formula simplification. DAG size of input: 22 DAG size of output: 16 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 00:31:07,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:31:12,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:31:15,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:31:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:31:15,487 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-24 00:31:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:31:15,489 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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) Word has length 8 [2024-11-24 00:31:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:31:15,489 INFO L225 Difference]: With dead ends: 13 [2024-11-24 00:31:15,489 INFO L226 Difference]: Without dead ends: 10 [2024-11-24 00:31:15,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 102.9s TimeCoverageRelationStatistics Valid=37, Invalid=43, Unknown=16, NotChecked=210, Total=306 [2024-11-24 00:31:15,491 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:31:15,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 75 Unchecked, 9.3s Time] [2024-11-24 00:31:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-24 00:31:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-24 00:31:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:31:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-24 00:31:15,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2024-11-24 00:31:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:31:15,497 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-24 00:31:15,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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:31:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-24 00:31:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-24 00:31:15,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:31:15,498 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2024-11-24 00:31:15,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:31:15,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:31:15,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:31:15,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:31:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 3 times [2024-11-24 00:31:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:31:15,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452847546] [2024-11-24 00:31:15,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 00:31:15,700 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:31:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:31:15,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:31:15,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:31:20,152 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-24 00:31:20,152 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:31:20,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-24 00:31:20,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:31:30,762 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:31:34,944 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-24 00:31:43,913 WARN L286 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:31:48,208 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-24 00:31:57,750 WARN L286 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:32:02,466 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-24 00:32:16,918 WARN L286 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:32:41,375 WARN L286 SmtUtils]: Spent 10.77s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 00:32:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-24 00:32:41,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:32:49,214 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:33:22,564 WARN L286 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 00:33:31,129 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:33:39,520 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:33:43,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-24 00:33:47,834 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-24 00:33:56,747 WARN L286 SmtUtils]: Spent 8.91s 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:34:05,476 WARN L286 SmtUtils]: Spent 8.73s 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:34:09,722 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-24 00:34:14,003 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-24 00:34:23,117 WARN L286 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:34:32,393 WARN L286 SmtUtils]: Spent 9.28s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:34:36,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-24 00:34:41,098 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-24 00:34:51,333 WARN L286 SmtUtils]: Spent 10.23s 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:35:01,151 WARN L286 SmtUtils]: Spent 9.82s 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:35:05,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-24 00:35:10,225 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-24 00:35:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-24 00:35:10,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:35:10,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452847546] [2024-11-24 00:35:10,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452847546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 00:35:10,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 00:35:10,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-24 00:35:10,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333402605] [2024-11-24 00:35:10,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 00:35:10,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 00:35:10,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:35:10,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 00:35:10,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=38, Unknown=16, NotChecked=126, Total=210 [2024-11-24 00:35:10,229 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:35:13,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s 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:35:18,338 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-24 00:35:22,780 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:35:26,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-24 00:35:31,206 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:35:38,391 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:35:43,129 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-24 00:35:47,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:35:50,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:35:55,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:35:59,008 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:36:00,270 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:36:04,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:36:08,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:36:11,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:36:15,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:36:17,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-24 00:36:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:36:17,444 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-24 00:36:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:36:17,445 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-24 00:36:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:36:17,445 INFO L225 Difference]: With dead ends: 14 [2024-11-24 00:36:17,445 INFO L226 Difference]: Without dead ends: 11 [2024-11-24 00:36:17,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 137.6s TimeCoverageRelationStatistics Valid=40, Invalid=42, Unknown=22, NotChecked=276, Total=380 [2024-11-24 00:36:17,447 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 37.8s IncrementalHoareTripleChecker+Time [2024-11-24 00:36:17,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 6 Unknown, 101 Unchecked, 37.8s Time] [2024-11-24 00:36:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-24 00:36:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-24 00:36:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:36:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-11-24 00:36:17,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2024-11-24 00:36:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:36:17,453 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-11-24 00:36:17,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:36:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-11-24 00:36:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-24 00:36:17,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:36:17,454 INFO L218 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2024-11-24 00:36:17,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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)] Ended with exit code 0 [2024-11-24 00:36:17,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:36:17,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:36:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:36:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 4 times [2024-11-24 00:36:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:36:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938114420] [2024-11-24 00:36:17,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 00:36:17,656 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:36:17,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 00:36:17,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:36:17,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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 (6)] Waiting until timeout for monitored process [2024-11-24 00:36:23,482 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 00:36:23,482 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:36:23,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-24 00:36:23,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:36:38,264 WARN L286 SmtUtils]: Spent 8.41s 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:36:42,440 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from false [2024-11-24 00:36:46,620 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from true [2024-11-24 00:36:55,254 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:36:59,530 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from false [2024-11-24 00:37:03,810 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from true [2024-11-24 00:37:12,790 WARN L286 SmtUtils]: Spent 8.98s 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:37:17,196 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from false [2024-11-24 00:37:21,670 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from true [2024-11-24 00:37:31,006 WARN L286 SmtUtils]: Spent 9.33s 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:37:35,528 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from false [2024-11-24 00:37:40,089 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from true [2024-11-24 00:37:50,557 WARN L286 SmtUtils]: Spent 10.47s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 00:38:00,182 WARN L286 SmtUtils]: Spent 9.62s 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:38:04,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from false [2024-11-24 00:38:09,397 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2024-11-24 00:38:25,069 WARN L286 SmtUtils]: Spent 10.69s 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:38:35,457 WARN L286 SmtUtils]: Spent 10.39s 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:38:50,545 WARN L286 SmtUtils]: Spent 10.45s 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:39:01,046 WARN L286 SmtUtils]: Spent 10.50s 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:39:07,291 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (_ bv1 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.eq .cse0 ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (fp.eq (fp.div currentRoundingMode .cse0 .cse1) .cse0)))))) (and (= (_ bv0 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (exists ((currentRoundingMode RoundingMode)) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) .cse3) .cse3) .cse3) .cse3) .cse3))) (and (not (fp.eq .cse2 ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))) (fp.eq (fp.div currentRoundingMode .cse2 .cse3) .cse2))))))) is different from false [2024-11-24 00:39:22,668 WARN L286 SmtUtils]: Spent 10.45s 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:39:32,874 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-24 00:39:32,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-24 00:39:32,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:39:32,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938114420] [2024-11-24 00:39:32,875 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-24 00:39:32,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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 (6)] Ended with exit code 0 [2024-11-24 00:39:33,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/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:39:33,076 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 62 more [2024-11-24 00:39:33,082 INFO L158 Benchmark]: Toolchain (without parser) took 774213.55ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 41.6MB in the end (delta: 50.8MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-24 00:39:33,085 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:39:33,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.14ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 81.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:39:33,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.10ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 80.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:39:33,086 INFO L158 Benchmark]: Boogie Preprocessor took 45.58ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:39:33,087 INFO L158 Benchmark]: RCFGBuilder took 5697.01ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 69.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:39:33,087 INFO L158 Benchmark]: TraceAbstraction took 768119.46ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 41.6MB in the end (delta: 27.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-24 00:39:33,090 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.31ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.14ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 81.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.10ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 80.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.58ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 5697.01ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 69.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 768119.46ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 41.6MB in the end (delta: 27.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3563d7e-ed9d-4ad4-92b4-220754cb3e0a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")