./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:28:28,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:28:28,942 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:28:28,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:28:28,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:28:28,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:28:28,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:28:28,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:28:28,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:28:28,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:28:28,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:28:29,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:28:29,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:28:29,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:28:29,001 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:28:29,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:28:29,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:28:29,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:28:29,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:28:29,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:28:29,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:28:29,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:28:29,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:28:29,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:28:29,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:28:29,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:28:29,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:28:29,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:28:29,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:28:29,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:28:29,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:28:29,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:28:29,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:28:29,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:28:29,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:28:29,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:28:29,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:28:29,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:28:29,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:28:29,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:28:29,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:28:29,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:28:29,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:28:29,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:28:29,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:28:29,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:28:29,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:28:29,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:28:29,007 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_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d [2024-11-28 03:28:29,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:28:29,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:28:29,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:28:29,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:28:29,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:28:29,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2024-11-28 03:28:33,217 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data/fcf8d53a2/15dff75e54bf4a139cebdee3f08e0466/FLAG5d41f8333 [2024-11-28 03:28:33,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:28:33,546 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2024-11-28 03:28:33,555 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data/fcf8d53a2/15dff75e54bf4a139cebdee3f08e0466/FLAG5d41f8333 [2024-11-28 03:28:33,585 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data/fcf8d53a2/15dff75e54bf4a139cebdee3f08e0466 [2024-11-28 03:28:33,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:28:33,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:28:33,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:28:33,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:28:33,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:28:33,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1cf92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33, skipping insertion in model container [2024-11-28 03:28:33,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:28:33,846 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_0b22d833-aef8-45fa-b082-046ffcaee565/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2024-11-28 03:28:33,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:28:33,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:28:33,901 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_0b22d833-aef8-45fa-b082-046ffcaee565/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2024-11-28 03:28:33,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:28:33,927 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:28:33,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33 WrapperNode [2024-11-28 03:28:33,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:28:33,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:28:33,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:28:33,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:28:33,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,967 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 24 [2024-11-28 03:28:33,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:28:33,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:28:33,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:28:33,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:28:33,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,994 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 03:28:33,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:33,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:34,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:34,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:34,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:34,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:34,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:28:34,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:28:34,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:28:34,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:28:34,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (1/1) ... [2024-11-28 03:28:34,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:28:34,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:28:34,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:28:34,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:28:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:28:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:28:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:28:34,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:28:34,174 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:28:34,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:28:34,294 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-28 03:28:34,298 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:28:34,314 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:28:34,314 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:28:34,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:28:34 BoogieIcfgContainer [2024-11-28 03:28:34,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:28:34,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:28:34,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:28:34,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:28:34,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:28:33" (1/3) ... [2024-11-28 03:28:34,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efce05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:28:34, skipping insertion in model container [2024-11-28 03:28:34,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:33" (2/3) ... [2024-11-28 03:28:34,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efce05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:28:34, skipping insertion in model container [2024-11-28 03:28:34,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:28:34" (3/3) ... [2024-11-28 03:28:34,335 INFO L128 eAbstractionObserver]: Analyzing ICFG Double_div.i [2024-11-28 03:28:34,356 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:28:34,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div.i that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:28:34,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:28:34,471 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;@10166cee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:28:34,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:28:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:28:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:28:34,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:28:34,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:28:34,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:28:34,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:28:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times [2024-11-28 03:28:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:28:34,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274284324] [2024-11-28 03:28:34,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:28:34,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:28:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:28:34,655 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:28:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:28:34,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:28:34,704 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:28:34,707 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:28:34,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:28:34,719 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-28 03:28:34,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:28:34,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:28:34 BoogieIcfgContainer [2024-11-28 03:28:34,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:28:34,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:28:34,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:28:34,749 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:28:34,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:28:34" (3/4) ... [2024-11-28 03:28:34,755 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:28:34,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:28:34,759 INFO L158 Benchmark]: Toolchain (without parser) took 1164.45ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 58.8MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 03:28:34,759 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:28:34,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.04ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 81.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:28:34,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.27ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.8MB in the end (delta: 932.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:28:34,762 INFO L158 Benchmark]: Boogie Preprocessor took 38.46ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:28:34,763 INFO L158 Benchmark]: RCFGBuilder took 307.84ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 71.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:28:34,765 INFO L158 Benchmark]: TraceAbstraction took 428.21ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 59.0MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:28:34,765 INFO L158 Benchmark]: Witness Printer took 8.03ms. Allocated memory is still 117.4MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:28:34,768 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.04ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 81.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.27ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.8MB in the end (delta: 932.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.46ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 307.84ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 71.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 428.21ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 59.0MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 8.03ms. Allocated memory is still 117.4MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 21, overapproximation of someBinaryDOUBLEComparisonOperation at line 29, overapproximation of someBinaryDOUBLEComparisonOperation at line 23. Possible FailurePath: [L20] double x = 1.0; [L21] double x1 = x/2.5; [L23] COND FALSE !(x1 != x) [L29] CALL __VERIFIER_assert(x == 0) [L13] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:28:34,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:28:38,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:28:38,379 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 03:28:38,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:28:38,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:28:38,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:28:38,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:28:38,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:28:38,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:28:38,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:28:38,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:28:38,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:28:38,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:28:38,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:28:38,451 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:28:38,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:28:38,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:28:38,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:28:38,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:28:38,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:28:38,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:28:38,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:28:38,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:28:38,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:28:38,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:28:38,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:28:38,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:28:38,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:28:38,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:28:38,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:28:38,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:28:38,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:28:38,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:28:38,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:28:38,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:28:38,458 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:28:38,458 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:28:38,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:28:38,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:28:38,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:28:38,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:28:38,459 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_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f4e199f6665b6821475945a72290dab8d4d620db3a5150842d6f2ec9f4c430d [2024-11-28 03:28:38,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:28:38,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:28:38,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:28:38,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:28:38,944 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:28:38,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2024-11-28 03:28:42,634 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data/9b3e85093/2088bf2a836c4a1a99f83c65309e3283/FLAGaa7826477 [2024-11-28 03:28:43,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:28:43,064 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2024-11-28 03:28:43,077 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data/9b3e85093/2088bf2a836c4a1a99f83c65309e3283/FLAGaa7826477 [2024-11-28 03:28:43,110 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/data/9b3e85093/2088bf2a836c4a1a99f83c65309e3283 [2024-11-28 03:28:43,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:28:43,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:28:43,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:28:43,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:28:43,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:28:43,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553cf6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43, skipping insertion in model container [2024-11-28 03:28:43,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:28:43,384 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_0b22d833-aef8-45fa-b082-046ffcaee565/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2024-11-28 03:28:43,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:28:43,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:28:43,448 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_0b22d833-aef8-45fa-b082-046ffcaee565/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2024-11-28 03:28:43,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:28:43,486 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:28:43,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43 WrapperNode [2024-11-28 03:28:43,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:28:43,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:28:43,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:28:43,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:28:43,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,537 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25 [2024-11-28 03:28:43,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:28:43,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:28:43,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:28:43,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:28:43,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,578 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 03:28:43,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:28:43,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:28:43,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:28:43,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:28:43,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (1/1) ... [2024-11-28 03:28:43,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:28:43,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:28:43,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:28:43,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:28:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:28:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:28:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:28:43,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:28:43,822 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:28:43,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:28:46,696 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-28 03:28:46,696 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:28:46,709 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:28:46,710 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:28:46,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:28:46 BoogieIcfgContainer [2024-11-28 03:28:46,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:28:46,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:28:46,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:28:46,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:28:46,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:28:43" (1/3) ... [2024-11-28 03:28:46,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ce285f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:28:46, skipping insertion in model container [2024-11-28 03:28:46,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:28:43" (2/3) ... [2024-11-28 03:28:46,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ce285f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:28:46, skipping insertion in model container [2024-11-28 03:28:46,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:28:46" (3/3) ... [2024-11-28 03:28:46,724 INFO L128 eAbstractionObserver]: Analyzing ICFG Double_div.i [2024-11-28 03:28:46,748 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:28:46,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div.i that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:28:46,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:28:46,866 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;@57041ba7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:28:46,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:28:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:28:46,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:28:46,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:28:46,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:28:46,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:28:46,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:28:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times [2024-11-28 03:28:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:28:46,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612821923] [2024-11-28 03:28:46,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:28:46,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:28:46,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:28:46,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:28:46,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-28 03:28:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:28:47,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:28:47,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:28:48,017 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-28 03:28:48,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:28:48,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:28:48,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612821923] [2024-11-28 03:28:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612821923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:28:48,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:28:48,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:28:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744975471] [2024-11-28 03:28:48,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:28:48,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:28:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:28:48,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:28:48,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:28:48,059 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:28:52,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:28:53,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:28:56,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:28:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:28:56,231 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-11-28 03:28:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:28:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 03:28:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:28:56,242 INFO L225 Difference]: With dead ends: 21 [2024-11-28 03:28:56,243 INFO L226 Difference]: Without dead ends: 9 [2024-11-28 03:28:56,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:28:56,250 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:28:56,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-28 03:28:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-28 03:28:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-28 03:28:56,286 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-28 03:28:56,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-28 03:28:56,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-28 03:28:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:28:56,293 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-28 03:28:56,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:28:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-28 03:28:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:28:56,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:28:56,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:28:56,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-28 03:28:56,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:28:56,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:28:56,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:28:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 207982255, now seen corresponding path program 1 times [2024-11-28 03:28:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:28:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396585907] [2024-11-28 03:28:56,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:28:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:28:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:28:56,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:28:56,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-28 03:28:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:28:56,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:28:56,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:28:58,559 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-28 03:28:58,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:21,261 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-28 03:29:21,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:29:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396585907] [2024-11-28 03:29:21,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396585907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:21,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:29:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 03:29:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864871099] [2024-11-28 03:29:21,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:21,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:29:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:29:21,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:29:21,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:29:21,266 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:29:44,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:29:46,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:29:50,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:29:54,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:29:58,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:30:02,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:30:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:02,924 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-28 03:30:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:30:02,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 03:30:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:02,925 INFO L225 Difference]: With dead ends: 17 [2024-11-28 03:30:02,926 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 03:30:02,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:30:02,927 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:02,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 23.9s Time] [2024-11-28 03:30:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 03:30:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-28 03:30:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:30:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-28 03:30:02,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2024-11-28 03:30:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:02,933 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-28 03:30:02,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:30:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-28 03:30:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 03:30:02,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:02,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:02,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-28 03:30:03,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:03,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:30:03,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1979056183, now seen corresponding path program 2 times [2024-11-28 03:30:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:03,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235957526] [2024-11-28 03:30:03,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:30:03,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:30:03,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:30:03,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-28 03:30:03,936 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:30:03,937 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:30:03,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 03:30:03,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:21,299 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-28 03:30:25,393 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:30:31,751 WARN L286 SmtUtils]: Spent 6.33s 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-28 03:30:40,806 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-28 03:30:45,547 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:30:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 03:30:45,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:53,965 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from true [2024-11-28 03:30:59,964 WARN L286 SmtUtils]: Spent 5.78s 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-28 03:31:08,144 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:31:16,146 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-28 03:31:20,209 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-28 03:31:28,408 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:31:36,656 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:31:45,090 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:31:50,955 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:31:55,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-28 03:31:59,157 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-28 03:32:07,552 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:32:15,887 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:32:24,538 WARN L286 SmtUtils]: Spent 8.65s 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-28 03:32:32,990 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:32:37,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-28 03:32:41,293 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-28 03:32:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-28 03:32:41,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:32:41,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235957526] [2024-11-28 03:32:41,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235957526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:32:41,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:32:41,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2024-11-28 03:32:41,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528151479] [2024-11-28 03:32:41,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:32:41,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:32:41,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:32:41,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:32:41,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=43, Unknown=9, NotChecked=102, Total=182 [2024-11-28 03:32:41,297 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:32:45,500 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:32:49,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:32:53,671 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:32:57,894 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:33:41,539 WARN L286 SmtUtils]: Spent 10.41s 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-28 03:33:46,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:33:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:46,955 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-28 03:33:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:33:46,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 03:33:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:46,957 INFO L225 Difference]: With dead ends: 19 [2024-11-28 03:33:46,957 INFO L226 Difference]: Without dead ends: 15 [2024-11-28 03:33:46,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 103.5s TimeCoverageRelationStatistics Valid=41, Invalid=67, Unknown=18, NotChecked=216, Total=342 [2024-11-28 03:33:46,959 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:46,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 1 Unknown, 111 Unchecked, 6.3s Time] [2024-11-28 03:33:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-28 03:33:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-28 03:33:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-28 03:33:46,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2024-11-28 03:33:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:46,965 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-28 03:33:46,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:33:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-28 03:33:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 03:33:46,966 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:46,966 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:46,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-28 03:33:47,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:33:47,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:33:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -858744965, now seen corresponding path program 3 times [2024-11-28 03:33:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:33:47,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324064142] [2024-11-28 03:33:47,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:33:47,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:33:47,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:33:47,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:33:47,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-28 03:33:48,017 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 03:33:48,017 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:33:48,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:33:48,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:04,994 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:34:27,720 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:34:36,072 WARN L286 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:34:44,230 WARN L286 SmtUtils]: Spent 8.16s 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-28 03:34:50,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (and (= (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_14| .cse0) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_main_~x~0#1_14|)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:35:02,013 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:35:10,181 WARN L286 SmtUtils]: Spent 8.17s 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-28 03:35:19,984 WARN L286 SmtUtils]: Spent 8.11s 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-28 03:35:24,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (and (= (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_14| .cse0) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_main_~x~0#1_14|)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:35:38,571 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:35:48,181 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:00,484 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:08,726 WARN L286 SmtUtils]: Spent 8.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-28 03:36:16,910 WARN L286 SmtUtils]: Spent 8.18s 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-28 03:36:21,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_14| .cse2))) (and (not (fp.eq .cse0 .cse1)) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_14|)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse2) .cse0)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_14| .cse2))) (and (fp.eq .cse3 .cse1) (not (fp.eq .cse3 |v_ULTIMATE.start_main_~x~0#1_14|))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2024-11-28 03:36:33,435 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:41,671 WARN L286 SmtUtils]: Spent 8.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-28 03:36:49,849 WARN L286 SmtUtils]: Spent 8.18s 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-28 03:36:53,914 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_14| .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_14|)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from false [2024-11-28 03:36:57,963 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_14| .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_14|)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0))))) is different from true [2024-11-28 03:36:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2024-11-28 03:36:57,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:37:16,236 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from true [2024-11-28 03:37:22,361 WARN L286 SmtUtils]: Spent 5.90s 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-28 03:37:30,489 WARN L286 SmtUtils]: Spent 8.13s 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-28 03:37:34,697 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) is different from true [2024-11-28 03:37:42,932 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:51,212 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:59,499 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:03,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_17|))))) is different from false [2024-11-28 03:38:07,626 WARN L873 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_17|))))) is different from true [2024-11-28 03:38:15,823 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:22,993 WARN L286 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:31,337 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:39,564 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:45,595 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:53,916 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:02,197 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:10,497 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:18,771 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:26,989 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:40,087 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:48,286 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:56,555 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:04,855 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:13,053 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:21,332 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:29,611 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 10 not checked. [2024-11-28 03:40:29,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:40:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324064142] [2024-11-28 03:40:29,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324064142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:40:29,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:40:29,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2024-11-28 03:40:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491142788] [2024-11-28 03:40:29,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:40:29,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:40:29,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:40:29,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:40:29,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=41, Unknown=13, NotChecked=126, Total=210 [2024-11-28 03:40:29,614 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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-28 03:40:31,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:40:35,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:40:39,593 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_17|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:40:43,671 WARN L873 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_17|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:40:48,208 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_17|)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse2) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:40:52,317 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_17|)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse2) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:40:56,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|))) (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0) (fp.eq .cse2 |v_ULTIMATE.start_main_~x~0#1_17|)))) (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (and (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |v_ULTIMATE.start_main_~x~0#1_14|)) (= (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_14| .cse1) |c_ULTIMATE.start_main_~x1~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:41:00,839 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|))) (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0) (fp.eq .cse2 |v_ULTIMATE.start_main_~x~0#1_17|)))) (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (and (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |v_ULTIMATE.start_main_~x~0#1_14|)) (= (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_14| .cse1) |c_ULTIMATE.start_main_~x1~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:41:05,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse3 (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_17|)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse2) (not .cse3)) (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (and (= (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_14| .cse1) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_main_~x~0#1_14|)))) (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse2) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|)) .cse3) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:41:09,402 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse3 (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_17| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 |v_ULTIMATE.start_main_~x~0#1_17|)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse2) (not .cse3)) (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (and (= (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_14| .cse1) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_main_~x~0#1_14|)))) (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse2) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) |c_ULTIMATE.start_main_~x1~0#1|)) .cse3) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:41:13,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (and (= (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_14| .cse0) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| |v_ULTIMATE.start_main_~x~0#1_14|)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:41:18,964 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) (and (not .cse0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_14| .cse3))) (and (not (fp.eq .cse1 .cse2)) (not (fp.eq .cse1 |v_ULTIMATE.start_main_~x~0#1_14|)) (fp.eq (fp.div roundNearestTiesToEven .cse1 .cse3) .cse1)))) .cse0) (and (exists ((|v_ULTIMATE.start_main_~x~0#1_14| (_ FloatingPoint 11 53))) (let ((.cse4 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~x~0#1_14| .cse3))) (and (fp.eq .cse4 .cse2) (not (fp.eq .cse4 |v_ULTIMATE.start_main_~x~0#1_14|))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))))) is different from false [2024-11-28 03:41:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:41:19,024 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-28 03:41:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:41:19,025 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 03:41:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:41:19,025 INFO L225 Difference]: With dead ends: 15 [2024-11-28 03:41:19,025 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 03:41:19,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 125.9s TimeCoverageRelationStatistics Valid=42, Invalid=43, Unknown=23, NotChecked=312, Total=420 [2024-11-28 03:41:19,027 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:41:19,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 91 Unchecked, 5.9s Time] [2024-11-28 03:41:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 03:41:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 03:41:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-28 03:41:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 03:41:19,032 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2024-11-28 03:41:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:41:19,032 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 03:41:19,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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-28 03:41:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 03:41:19,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 03:41:19,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:41:19,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-28 03:41:19,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:41:19,240 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-28 03:41:19,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-28 03:42:38,436 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 03:42:38,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 03:42:38,438 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_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:309) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:162) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.(HoareAnnotationComposer.java:111) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.NwaHoareProofProducer.computeHoareAnnotationComposer(NwaHoareProofProducer.java:152) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.NwaHoareProofProducer.lambda$3(NwaHoareProofProducer.java:139) at de.uni_freiburg.informatik.ultimate.util.statistics.TimeTracker.measure(TimeTracker.java:50) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.NwaHoareProofProducer$Statistics.measureProofComputation(NwaHoareProofProducer.java:191) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.NwaHoareProofProducer.computeProof(NwaHoareProofProducer.java:138) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.NwaHoareProofProducer.getOrComputeProof(NwaHoareProofProducer.java:132) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.NwaHoareProofProducer.getOrComputeProof(NwaHoareProofProducer.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.initialabstraction.BacktranslatingProofProducer.getOrComputeProof(BacktranslatingProofProducer.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:436) 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) ... 42 more [2024-11-28 03:42:38,443 INFO L158 Benchmark]: Toolchain (without parser) took 835327.42ms. Allocated memory is still 117.4MB. Free memory was 94.9MB in the beginning and 45.8MB in the end (delta: 49.1MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-11-28 03:42:38,443 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:42:38,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.05ms. Allocated memory is still 117.4MB. Free memory was 94.7MB in the beginning and 83.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:42:38,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.91ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 82.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:42:38,445 INFO L158 Benchmark]: Boogie Preprocessor took 69.46ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 80.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:42:38,446 INFO L158 Benchmark]: RCFGBuilder took 3099.71ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 71.8MB in the end (delta: 9.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:42:38,446 INFO L158 Benchmark]: TraceAbstraction took 831728.77ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 45.8MB in the end (delta: 25.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-28 03:42:38,448 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.53ms. Allocated memory is still 83.9MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.05ms. Allocated memory is still 117.4MB. Free memory was 94.7MB in the beginning and 83.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.91ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 82.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.46ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 80.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 3099.71ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 71.8MB in the end (delta: 9.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 831728.77ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 45.8MB in the end (delta: 25.4MB). Peak memory consumption was 21.4MB. 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 - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/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_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/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_0b22d833-aef8-45fa-b082-046ffcaee565/bin/uautomizer-verify-aQ6SnzHsRB/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")