./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX --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 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 19:02:33,099 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 19:02:33,187 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 19:02:33,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 19:02:33,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 19:02:33,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 19:02:33,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 19:02:33,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 19:02:33,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 19:02:33,232 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 19:02:33,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 19:02:33,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 19:02:33,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 19:02:33,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 19:02:33,234 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 19:02:33,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 19:02:33,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 19:02:33,235 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 19:02:33,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 19:02:33,236 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 19:02:33,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 19:02:33,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 19:02:33,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 19:02:33,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 19:02:33,238 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 19:02:33,239 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 19:02:33,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 19:02:33,251 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 19:02:33,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 19:02:33,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 19:02:33,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 19:02:33,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 19:02:33,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 19:02:33,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 19:02:33,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 19:02:33,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 19:02:33,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 19:02:33,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 19:02:33,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 19:02:33,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 19:02:33,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 19:02:33,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 19:02:33,261 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX
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 -> 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf
[2024-11-08 19:02:33,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 19:02:33,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 19:02:33,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 19:02:33,553 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 19:02:33,554 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 19:02:33,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c
Unable to find full path for "g++"
[2024-11-08 19:02:35,593 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 19:02:35,775 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 19:02:35,776 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c
[2024-11-08 19:02:35,785 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/data/6c71976a8/950b78b4e62a45c3be231dbd618417e0/FLAG6ed1a3f89
[2024-11-08 19:02:35,801 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/data/6c71976a8/950b78b4e62a45c3be231dbd618417e0
[2024-11-08 19:02:35,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 19:02:35,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 19:02:35,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 19:02:35,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 19:02:35,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 19:02:35,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:02:35" (1/1) ...
[2024-11-08 19:02:35,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6430a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:35, skipping insertion in model container
[2024-11-08 19:02:35,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:02:35" (1/1) ...
[2024-11-08 19:02:35,841 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 19:02:36,066 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_bb6658c3-7aef-401a-84ae-07d3a40e1863/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683]
[2024-11-08 19:02:36,071 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:02:36,081 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 19:02:36,093 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_bb6658c3-7aef-401a-84ae-07d3a40e1863/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683]
[2024-11-08 19:02:36,093 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:02:36,108 INFO L204 MainTranslator]: Completed translation
[2024-11-08 19:02:36,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36 WrapperNode
[2024-11-08 19:02:36,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 19:02:36,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 19:02:36,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 19:02:36,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 19:02:36,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,144 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28
[2024-11-08 19:02:36,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 19:02:36,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 19:02:36,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 19:02:36,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 19:02:36,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,171 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-08 19:02:36,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 19:02:36,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 19:02:36,190 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 19:02:36,191 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 19:02:36,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (1/1) ...
[2024-11-08 19:02:36,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 19:02:36,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 19:02:36,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 19:02:36,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 19:02:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 19:02:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 19:02:36,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 19:02:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 19:02:36,329 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 19:02:36,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 19:02:36,419 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2024-11-08 19:02:36,420 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 19:02:36,429 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 19:02:36,430 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 19:02:36,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:36 BoogieIcfgContainer
[2024-11-08 19:02:36,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 19:02:36,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 19:02:36,432 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 19:02:36,435 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 19:02:36,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:02:35" (1/3) ...
[2024-11-08 19:02:36,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f13ebee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:02:36, skipping insertion in model container
[2024-11-08 19:02:36,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:36" (2/3) ...
[2024-11-08 19:02:36,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f13ebee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:02:36, skipping insertion in model container
[2024-11-08 19:02:36,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:36" (3/3) ...
[2024-11-08 19:02:36,439 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c
[2024-11-08 19:02:36,462 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 19:02:36,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 19:02:36,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 19:02:36,531 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;@5f9bc621, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 19:02:36,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 19:02:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:02:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-08 19:02:36,548 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:02:36,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-08 19:02:36,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:02:36,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:02:36,557 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times
[2024-11-08 19:02:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:02:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179832477]
[2024-11-08 19:02:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:02:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:02:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:02:36,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:02:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:02:36,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:02:36,717 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 19:02:36,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 19:02:36,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 19:02:36,723 INFO L407 BasicCegarLoop]: Path program histogram: [1]
[2024-11-08 19:02:36,739 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 19:02:36,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:02:36 BoogieIcfgContainer
[2024-11-08 19:02:36,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 19:02:36,743 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 19:02:36,744 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 19:02:36,744 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 19:02:36,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:36" (3/4) ...
[2024-11-08 19:02:36,750 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 19:02:36,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 19:02:36,753 INFO L158 Benchmark]: Toolchain (without parser) took 947.41ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 66.0MB in the end (delta: 39.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
[2024-11-08 19:02:36,754 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 19:02:36,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.25ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.2MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-08 19:02:36,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.50ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 19:02:36,757 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 19:02:36,759 INFO L158 Benchmark]: RCFGBuilder took 239.90ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 80.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-08 19:02:36,760 INFO L158 Benchmark]: TraceAbstraction took 310.88ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 66.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-08 19:02:36,761 INFO L158 Benchmark]: Witness Printer took 7.88ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 66.0MB in the end (delta: 498.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 19:02:36,769 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.33ms. Allocated memory is still 142.6MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 302.25ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.2MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 35.50ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 39.34ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 239.90ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 80.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 310.88ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 66.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Witness Printer took 7.88ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 66.0MB in the end (delta: 498.0kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10.
Possible FailurePath:
[L1] int __return_main;
VAL [__return_main=0]
[L9] double main__x = 1.0;
[L10] double main__x1 = main__x / 2.5;
VAL [__return_main=0]
[L12] COND FALSE !(main__x1 != main__x)
[L21] int __tmp_1;
[L22] __tmp_1 = main__x == 0
[L23] int __VERIFIER_assert__cond;
[L24] __VERIFIER_assert__cond = __tmp_1
VAL [__VERIFIER_assert__cond=0, __return_main=0]
[L25] COND TRUE __VERIFIER_assert__cond == 0
VAL [__return_main=0]
[L27] reach_error()
VAL [__return_main=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-08 19:02:36,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX --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 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 19:02:39,337 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 19:02:39,429 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 19:02:39,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 19:02:39,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 19:02:39,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 19:02:39,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 19:02:39,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 19:02:39,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 19:02:39,478 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 19:02:39,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 19:02:39,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 19:02:39,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 19:02:39,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 19:02:39,486 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 19:02:39,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 19:02:39,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 19:02:39,487 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 19:02:39,487 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 19:02:39,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 19:02:39,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 19:02:39,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 19:02:39,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 19:02:39,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 19:02:39,491 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 19:02:39,491 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 19:02:39,492 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 19:02:39,492 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 19:02:39,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 19:02:39,493 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 19:02:39,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 19:02:39,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 19:02:39,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 19:02:39,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 19:02:39,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 19:02:39,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 19:02:39,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 19:02:39,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 19:02:39,496 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 19:02:39,496 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 19:02:39,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 19:02:39,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 19:02:39,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 19:02:39,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 19:02:39,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX
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 -> 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf
[2024-11-08 19:02:39,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 19:02:39,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 19:02:39,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 19:02:39,950 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 19:02:39,950 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 19:02:39,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c
Unable to find full path for "g++"
[2024-11-08 19:02:42,054 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 19:02:42,246 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 19:02:42,247 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c
[2024-11-08 19:02:42,254 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/data/b3ffd9209/97ab0207ed684ced943d8f804ff545c1/FLAGd11a30a2d
[2024-11-08 19:02:42,660 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/data/b3ffd9209/97ab0207ed684ced943d8f804ff545c1
[2024-11-08 19:02:42,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 19:02:42,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 19:02:42,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 19:02:42,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 19:02:42,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 19:02:42,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:02:42" (1/1) ...
[2024-11-08 19:02:42,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9b0241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:42, skipping insertion in model container
[2024-11-08 19:02:42,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:02:42" (1/1) ...
[2024-11-08 19:02:42,716 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 19:02:43,028 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_bb6658c3-7aef-401a-84ae-07d3a40e1863/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683]
[2024-11-08 19:02:43,037 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:02:43,058 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 19:02:43,079 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_bb6658c3-7aef-401a-84ae-07d3a40e1863/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683]
[2024-11-08 19:02:43,080 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:02:43,103 INFO L204 MainTranslator]: Completed translation
[2024-11-08 19:02:43,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43 WrapperNode
[2024-11-08 19:02:43,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 19:02:43,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 19:02:43,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 19:02:43,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 19:02:43,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,146 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29
[2024-11-08 19:02:43,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 19:02:43,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 19:02:43,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 19:02:43,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 19:02:43,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,182 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-08 19:02:43,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 19:02:43,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 19:02:43,215 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 19:02:43,217 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 19:02:43,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (1/1) ...
[2024-11-08 19:02:43,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 19:02:43,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 19:02:43,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 19:02:43,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 19:02:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 19:02:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 19:02:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 19:02:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 19:02:43,396 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 19:02:43,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 19:02:44,579 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2024-11-08 19:02:44,579 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 19:02:44,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 19:02:44,604 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 19:02:44,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:44 BoogieIcfgContainer
[2024-11-08 19:02:44,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 19:02:44,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 19:02:44,608 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 19:02:44,613 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 19:02:44,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:02:42" (1/3) ...
[2024-11-08 19:02:44,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d700c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:02:44, skipping insertion in model container
[2024-11-08 19:02:44,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:02:43" (2/3) ...
[2024-11-08 19:02:44,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d700c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:02:44, skipping insertion in model container
[2024-11-08 19:02:44,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:44" (3/3) ...
[2024-11-08 19:02:44,616 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c
[2024-11-08 19:02:44,646 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 19:02:44,646 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 19:02:44,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 19:02:44,731 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;@3a252643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 19:02:44,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 19:02:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:02:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-08 19:02:44,747 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:02:44,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-08 19:02:44,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:02:44,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:02:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times
[2024-11-08 19:02:44,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 19:02:44,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985389312]
[2024-11-08 19:02:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:02:44,780 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-08 19:02:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 19:02:44,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:02:44,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:02:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:45,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 19:02:45,059 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:02:46,516 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-08 19:02:46,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 19:02:46,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 19:02:46,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985389312]
[2024-11-08 19:02:46,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985389312] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:02:46,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:02:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:02:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097657378]
[2024-11-08 19:02:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:02:46,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 19:02:46,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 19:02:46,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 19:02:46,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 19:02:46,550 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:02:51,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:02:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:02:51,013 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions.
[2024-11-08 19:02:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 19:02:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2024-11-08 19:02:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:02:51,047 INFO L225 Difference]: With dead ends: 16
[2024-11-08 19:02:51,047 INFO L226 Difference]: Without dead ends: 7
[2024-11-08 19:02:51,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 19:02:51,053 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2024-11-08 19:02:51,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2024-11-08 19:02:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states.
[2024-11-08 19:02:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7.
[2024-11-08 19:02:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:02:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions.
[2024-11-08 19:02:51,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5
[2024-11-08 19:02:51,077 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:02:51,077 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions.
[2024-11-08 19:02:51,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:02:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions.
[2024-11-08 19:02:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-08 19:02:51,078 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:02:51,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-08 19:02:51,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:02:51,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:02:51,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:02:51,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:02:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times
[2024-11-08 19:02:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 19:02:51,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815082385]
[2024-11-08 19:02:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:02:51,281 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-08 19:02:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 19:02:51,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:02:51,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:02:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:02:51,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 19:02:51,634 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:02:53,626 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-08 19:02:53,627 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 19:03:05,458 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-08 19:03:05,459 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 19:03:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815082385]
[2024-11-08 19:03:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815082385] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 19:03:05,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 19:03:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7
[2024-11-08 19:03:05,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517464955]
[2024-11-08 19:03:05,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 19:03:05,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 19:03:05,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 19:03:05,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 19:03:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-08 19:03:05,463 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:03:07,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:09,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:12,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:29,920 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 19:03:33,997 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-08 19:03:38,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:40,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:03:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:03:41,569 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions.
[2024-11-08 19:03:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 19:03:41,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-08 19:03:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:03:41,571 INFO L225 Difference]: With dead ends: 13
[2024-11-08 19:03:41,571 INFO L226 Difference]: Without dead ends: 10
[2024-11-08 19:03:41,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110
[2024-11-08 19:03:41,575 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time
[2024-11-08 19:03:41,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 16.9s Time]
[2024-11-08 19:03:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states.
[2024-11-08 19:03:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10.
[2024-11-08 19:03:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:03:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions.
[2024-11-08 19:03:41,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6
[2024-11-08 19:03:41,580 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:03:41,580 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions.
[2024-11-08 19:03:41,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:03:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions.
[2024-11-08 19:03:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-11-08 19:03:41,581 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:03:41,582 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1]
[2024-11-08 19:03:41,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0
[2024-11-08 19:03:41,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:03:41,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:03:41,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:03:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times
[2024-11-08 19:03:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 19:03:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407501356]
[2024-11-08 19:03:41,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 19:03:41,785 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-08 19:03:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 19:03:41,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:03:41,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:03:42,991 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 19:03:42,991 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 19:03:43,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-08 19:03:43,041 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:03:49,167 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 ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-08 19:03:57,150 WARN L286 SmtUtils]: Spent 7.96s 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-08 19:04:01,257 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_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-08 19:04:10,036 WARN L286 SmtUtils]: Spent 8.75s 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-08 19:04:27,352 WARN L286 SmtUtils]: Spent 8.57s 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-08 19:04:36,549 WARN L286 SmtUtils]: Spent 8.82s 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-08 19:04:40,603 WARN L873 $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_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-08 19:04:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked.
[2024-11-08 19:04:40,682 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 19:05:10,108 WARN L286 SmtUtils]: Spent 5.93s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 19:05:18,281 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:05:26,539 WARN L286 SmtUtils]: Spent 8.26s 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-08 19:05:30,596 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_~main__x1~0#1| .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-08 19:05:34,656 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_~main__x1~0#1| .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-08 19:05:43,023 WARN L286 SmtUtils]: Spent 8.36s 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-08 19:05:51,445 WARN L286 SmtUtils]: Spent 8.42s 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-08 19:05:55,545 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_~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-08 19:05:59,642 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_~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-08 19:06:08,259 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:16,771 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:20,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false
[2024-11-08 19:06:25,048 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true
[2024-11-08 19:06:33,916 WARN L286 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:42,807 WARN L286 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 19:06:47,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false
[2024-11-08 19:06:51,252 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true
[2024-11-08 19:06:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked.
[2024-11-08 19:06:51,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 19:06:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407501356]
[2024-11-08 19:06:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407501356] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 19:06:51,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 19:06:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14
[2024-11-08 19:06:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563187119]
[2024-11-08 19:06:51,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 19:06:51,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-08 19:06:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 19:06:51,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-08 19:06:51,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=38, Unknown=15, NotChecked=126, Total=210
[2024-11-08 19:06:51,257 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:06:55,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-08 19:06:59,571 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-08 19:07:03,730 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 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= |c_ULTIMATE.start_main_~main__x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-08 19:07:07,799 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-08 19:07:11,909 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-08 19:07:16,004 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_~main__x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-08 19:07:18,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:07:23,836 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|))) (or (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-08 19:07:25,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:07:30,801 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-08 19:07:34,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 19:07:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:07:34,932 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions.
[2024-11-08 19:07:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 19:07:34,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9
[2024-11-08 19:07:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:07:34,934 INFO L225 Difference]: With dead ends: 16
[2024-11-08 19:07:34,935 INFO L226 Difference]: Without dead ends: 12
[2024-11-08 19:07:34,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 109.5s TimeCoverageRelationStatistics Valid=41, Invalid=42, Unknown=21, NotChecked=276, Total=380
[2024-11-08 19:07:34,937 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time
[2024-11-08 19:07:34,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 3 Unknown, 115 Unchecked, 17.8s Time]
[2024-11-08 19:07:34,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states.
[2024-11-08 19:07:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12.
[2024-11-08 19:07:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-08 19:07:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions.
[2024-11-08 19:07:34,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9
[2024-11-08 19:07:34,941 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:07:34,942 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions.
[2024-11-08 19:07:34,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:07:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions.
[2024-11-08 19:07:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-08 19:07:34,943 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 19:07:34,943 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1]
[2024-11-08 19:07:34,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:07:35,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:07:35,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 19:07:35,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:07:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash 555748550, now seen corresponding path program 3 times
[2024-11-08 19:07:35,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 19:07:35,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449536168]
[2024-11-08 19:07:35,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 19:07:35,146 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-08 19:07:35,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 19:07:35,150 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:07:35,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:07:36,106 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2024-11-08 19:07:36,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 19:07:36,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 19:07:36,136 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 19:07:52,787 WARN L286 SmtUtils]: Spent 8.22s 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-08 19:07:58,780 WARN L286 SmtUtils]: Spent 5.99s 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-08 19:08:04,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (= |c_ULTIMATE.start_main_~main__x~0#1| .cse0)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-08 19:08:19,176 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-08 19:08:40,486 WARN L286 SmtUtils]: Spent 8.19s 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-08 19:08:48,810 WARN L286 SmtUtils]: Spent 8.32s 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-08 19:08:57,045 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-08 19:09:01,174 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 (= (_ bv1 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse2))) (and (fp.eq .cse0 .cse1) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)))))) (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse2))) (and (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse2) .cse3) (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (not (fp.eq .cse3 .cse1))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)))) is different from false
[2024-11-08 19:09:13,494 WARN L286 SmtUtils]: Spent 8.20s 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-08 19:09:20,772 WARN L286 SmtUtils]: Spent 7.28s 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-08 19:09:29,029 WARN L286 SmtUtils]: Spent 8.26s 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-08 19:09:33,085 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from false
[2024-11-08 19:09:37,131 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from true
[2024-11-08 19:09:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked.
[2024-11-08 19:09:37,132 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 19:09:55,936 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-08 19:10:00,154 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) is different from true
[2024-11-08 19:10:08,501 WARN L286 SmtUtils]: Spent 8.33s 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-08 19:10:16,715 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-08 19:10:25,029 WARN L286 SmtUtils]: Spent 8.31s 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-08 19:10:29,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ 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_~main__x~0#1_20| .cse1))) (or (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_20|) (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-08 19:10:33,154 WARN L873 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ 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_~main__x~0#1_20| .cse1))) (or (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_20|) (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-08 19:10:41,445 WARN L286 SmtUtils]: Spent 8.29s 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-08 19:10:49,650 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-08 19:10:57,950 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-08 19:11:04,473 WARN L286 SmtUtils]: Spent 6.52s 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-08 19:11:12,719 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-08 19:11:21,030 WARN L286 SmtUtils]: Spent 8.31s 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-08 19:11:29,346 WARN L286 SmtUtils]: Spent 8.31s 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-08 19:11:37,554 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-08 19:11:45,845 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-08 19:11:54,178 WARN L286 SmtUtils]: Spent 8.33s 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-08 19:12:02,374 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-08 19:12:10,665 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-08 19:12:19,000 WARN L286 SmtUtils]: Spent 8.33s 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-08 19:12:27,202 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-08 19:12:35,558 WARN L286 SmtUtils]: Spent 8.36s 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-08 19:12:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 11 not checked.
[2024-11-08 19:12:35,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 19:12:35,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449536168]
[2024-11-08 19:12:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449536168] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 19:12:35,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 19:12:35,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10
[2024-11-08 19:12:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87465720]
[2024-11-08 19:12:35,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 19:12:35,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 19:12:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 19:12:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 19:12:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=23, Unknown=7, NotChecked=60, Total=110
[2024-11-08 19:12:35,562 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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-08 19:12:40,572 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ 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_~main__x~0#1_20| .cse1))) (or (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false
[2024-11-08 19:12:44,642 WARN L873 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ 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_~main__x~0#1_20| .cse1))) (or (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-08 19:12:49,140 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_~main__x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse2 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-08 19:12:53,239 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_~main__x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse2 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-08 19:12:57,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse2 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) .cse2) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (= |c_ULTIMATE.start_main_~main__x~0#1| .cse3)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse4 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse4 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse1) .cse4)) (fp.eq .cse4 .cse0)))) (or (not .cse2) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-08 19:13:01,865 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse2 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) .cse2) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (= |c_ULTIMATE.start_main_~main__x~0#1| .cse3)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse4 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse4 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse1) .cse4)) (fp.eq .cse4 .cse0)))) (or (not .cse2) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-08 19:13:05,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (or (and (= (_ bv1 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse2))) (and (fp.eq .cse0 .cse1) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)))))) (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse2))) (and (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse2) .cse3) (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (not (fp.eq .cse3 .cse1))))) .cse4))) (not .cse4))) is different from false
[2024-11-08 19:13:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:13:05,948 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions.
[2024-11-08 19:13:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 19:13:05,949 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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 11
[2024-11-08 19:13:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 19:13:05,949 INFO L225 Difference]: With dead ends: 12
[2024-11-08 19:13:05,950 INFO L226 Difference]: Without dead ends: 0
[2024-11-08 19:13:05,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.8s TimeCoverageRelationStatistics Valid=28, Invalid=24, Unknown=14, NotChecked=144, Total=210
[2024-11-08 19:13:05,952 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 19:13:05,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 33 Unchecked, 1.0s Time]
[2024-11-08 19:13:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-08 19:13:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-08 19:13:05,954 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-08 19:13:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-08 19:13:05,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11
[2024-11-08 19:13:05,954 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 19:13:05,955 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 19:13:05,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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-08 19:13:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-08 19:13:05,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-08 19:13:05,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 19:13:05,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0
[2024-11-08 19:13:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/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-08 19:13:06,164 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1]
[2024-11-08 19:13:06,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-08 19:13:06,181 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 19:13:06,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:13:06 BoogieIcfgContainer
[2024-11-08 19:13:06,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 19:13:06,191 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 19:13:06,191 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 19:13:06,191 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 19:13:06,192 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:44" (3/4) ...
[2024-11-08 19:13:06,195 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-08 19:13:06,205 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges
[2024-11-08 19:13:06,205 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2024-11-08 19:13:06,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-08 19:13:06,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-08 19:13:06,353 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/witness.graphml
[2024-11-08 19:13:06,353 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/witness.yml
[2024-11-08 19:13:06,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 19:13:06,355 INFO L158 Benchmark]: Toolchain (without parser) took 623684.03ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 33.2MB in the beginning and 65.9MB in the end (delta: -32.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 19:13:06,355 INFO L158 Benchmark]: CDTParser took 1.39ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 19:13:06,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.18ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 32.9MB in the beginning and 65.1MB in the end (delta: -32.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB.
[2024-11-08 19:13:06,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.62ms. Allocated memory is still 92.3MB. Free memory was 65.1MB in the beginning and 63.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 19:13:06,359 INFO L158 Benchmark]: Boogie Preprocessor took 65.90ms. Allocated memory is still 92.3MB. Free memory was 63.9MB in the beginning and 62.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 19:13:06,359 INFO L158 Benchmark]: RCFGBuilder took 1390.67ms. Allocated memory is still 92.3MB. Free memory was 62.0MB in the beginning and 52.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-08 19:13:06,359 INFO L158 Benchmark]: TraceAbstraction took 621582.09ms. Allocated memory is still 92.3MB. Free memory was 51.8MB in the beginning and 70.1MB in the end (delta: -18.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 19:13:06,360 INFO L158 Benchmark]: Witness Printer took 162.95ms. Allocated memory is still 92.3MB. Free memory was 69.5MB in the beginning and 65.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 19:13:06,363 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 1.39ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 426.18ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 32.9MB in the beginning and 65.1MB in the end (delta: -32.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 41.62ms. Allocated memory is still 92.3MB. Free memory was 65.1MB in the beginning and 63.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 65.90ms. Allocated memory is still 92.3MB. Free memory was 63.9MB in the beginning and 62.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1390.67ms. Allocated memory is still 92.3MB. Free memory was 62.0MB in the beginning and 52.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 621582.09ms. Allocated memory is still 92.3MB. Free memory was 51.8MB in the beginning and 70.1MB in the end (delta: -18.3MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 162.95ms. Allocated memory is still 92.3MB. Free memory was 69.5MB in the beginning and 65.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. 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
- PositiveResult [Line: 27]: a call to reach_error is unreachable
For all program executions holds that a call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 621.5s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 114.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 38.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 38.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 148 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 13 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 210.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 503.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 9 QuantifiedInterpolants, 885 SizeOfPredicates, 9 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 25/64 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
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2024-11-08 19:13:06,586 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process
[2024-11-08 19:13:06,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb6658c3-7aef-401a-84ae-07d3a40e1863/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE