./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.v+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_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:50:01,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:50:01,666 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:50:01,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:50:01,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:50:01,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:50:01,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:50:01,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:50:01,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:50:01,717 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:50:01,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:50:01,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:50:01,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:50:01,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:50:01,720 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:50:01,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:50:01,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:50:01,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:50:01,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:50:01,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:50:01,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:50:01,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:50:01,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:50:01,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:50:01,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:50:01,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:50:01,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:50:01,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:50:01,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:50:01,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:50:01,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:50:01,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:50:01,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:50:01,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:50:01,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:50:01,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:50:01,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:50:01,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:50:01,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:50:01,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:50:01,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:50:01,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:50:01,738 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_da314776-cd0a-4b74-bc05-ddcce04fdb46/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_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2024-11-08 16:50:02,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:50:02,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:50:02,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:50:02,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:50:02,092 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:50:02,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c Unable to find full path for "g++" [2024-11-08 16:50:04,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:50:04,608 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:50:04,608 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2024-11-08 16:50:04,618 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/data/08c17a054/26f7efdccbf242d9b67e839089874416/FLAG51ae705b5 [2024-11-08 16:50:04,634 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/data/08c17a054/26f7efdccbf242d9b67e839089874416 [2024-11-08 16:50:04,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:50:04,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:50:04,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:50:04,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:50:04,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:50:04,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:50:04" (1/1) ... [2024-11-08 16:50:04,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a448b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:04, skipping insertion in model container [2024-11-08 16:50:04,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:50:04" (1/1) ... [2024-11-08 16:50:04,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:50:04,973 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_da314776-cd0a-4b74-bc05-ddcce04fdb46/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2024-11-08 16:50:04,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:50:04,995 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:50:05,019 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_da314776-cd0a-4b74-bc05-ddcce04fdb46/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2024-11-08 16:50:05,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:50:05,043 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:50:05,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05 WrapperNode [2024-11-08 16:50:05,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:50:05,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:50:05,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:50:05,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:50:05,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,094 INFO L138 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 110 [2024-11-08 16:50:05,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:50:05,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:50:05,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:50:05,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:50:05,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,154 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2024-11-08 16:50:05,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:50:05,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:50:05,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:50:05,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:50:05,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (1/1) ... [2024-11-08 16:50:05,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:50:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:50:05,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:50:05,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:50:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:50:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:50:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:50:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 16:50:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 16:50:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 16:50:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 16:50:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 16:50:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:50:05,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:50:05,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 16:50:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 16:50:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 16:50:05,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:50:05,400 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:50:05,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:50:05,603 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 16:50:05,603 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:50:05,618 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:50:05,619 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:50:05,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:05 BoogieIcfgContainer [2024-11-08 16:50:05,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:50:05,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:50:05,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:50:05,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:50:05,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:50:04" (1/3) ... [2024-11-08 16:50:05,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d85799b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:50:05, skipping insertion in model container [2024-11-08 16:50:05,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:05" (2/3) ... [2024-11-08 16:50:05,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d85799b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:50:05, skipping insertion in model container [2024-11-08 16:50:05,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:05" (3/3) ... [2024-11-08 16:50:05,635 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2024-11-08 16:50:05,665 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:50:05,665 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:50:05,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:50:05,748 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;@5e3c9123, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:50:05,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:50:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:50:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 16:50:05,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:05,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:05,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:05,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:05,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2024-11-08 16:50:05,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:50:05,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754831835] [2024-11-08 16:50:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:50:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:06,183 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 16:50:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:50:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754831835] [2024-11-08 16:50:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754831835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:06,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:50:06,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176321752] [2024-11-08 16:50:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:06,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:50:06,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:50:06,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:50:06,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:50:06,225 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 16:50:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:06,299 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-11-08 16:50:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:50:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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) Word has length 12 [2024-11-08 16:50:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:06,310 INFO L225 Difference]: With dead ends: 25 [2024-11-08 16:50:06,310 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 16:50:06,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:50:06,317 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:06,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:50:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 16:50:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 16:50:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) 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 16:50:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-08 16:50:06,353 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2024-11-08 16:50:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:06,353 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-08 16:50:06,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 16:50:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-08 16:50:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 16:50:06,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:06,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:50:06,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1736001843, now seen corresponding path program 1 times [2024-11-08 16:50:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:50:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168155389] [2024-11-08 16:50:06,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:06,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:50:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:06,535 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 16:50:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:50:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168155389] [2024-11-08 16:50:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168155389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:06,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:06,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:50:06,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142176151] [2024-11-08 16:50:06,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:50:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:50:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:50:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:50:06,544 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 16:50:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:06,572 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-08 16:50:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:50:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Word has length 12 [2024-11-08 16:50:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:06,574 INFO L225 Difference]: With dead ends: 33 [2024-11-08 16:50:06,574 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 16:50:06,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:50:06,577 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:06,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:50:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 16:50:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2024-11-08 16:50:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 16:50:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-08 16:50:06,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2024-11-08 16:50:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:06,584 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-08 16:50:06,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 16:50:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-08 16:50:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:50:06,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:06,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:06,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:50:06,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:06,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:06,587 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2024-11-08 16:50:06,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:50:06,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883001281] [2024-11-08 16:50:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:06,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:50:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:50:06,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:50:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:50:06,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:50:06,672 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:50:06,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:50:06,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:50:06,681 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 16:50:06,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:50:06,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:50:06 BoogieIcfgContainer [2024-11-08 16:50:06,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:50:06,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:50:06,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:50:06,731 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:50:06,732 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:05" (3/4) ... [2024-11-08 16:50:06,737 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:50:06,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:50:06,739 INFO L158 Benchmark]: Toolchain (without parser) took 2099.14ms. Allocated memory is still 174.1MB. Free memory was 132.0MB in the beginning and 123.3MB in the end (delta: 8.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-08 16:50:06,739 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 138.4MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:50:06,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.27ms. Allocated memory is still 174.1MB. Free memory was 131.4MB in the beginning and 118.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 16:50:06,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.75ms. Allocated memory is still 174.1MB. Free memory was 118.8MB in the beginning and 116.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:50:06,745 INFO L158 Benchmark]: Boogie Preprocessor took 103.18ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 114.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:50:06,746 INFO L158 Benchmark]: RCFGBuilder took 420.28ms. Allocated memory is still 174.1MB. Free memory was 114.6MB in the beginning and 102.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 16:50:06,746 INFO L158 Benchmark]: TraceAbstraction took 1105.01ms. Allocated memory is still 174.1MB. Free memory was 101.7MB in the beginning and 123.3MB in the end (delta: -21.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:50:06,747 INFO L158 Benchmark]: Witness Printer took 10.23ms. Allocated memory is still 174.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:50:06,753 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.25ms. Allocated memory is still 138.4MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.27ms. Allocated memory is still 174.1MB. Free memory was 131.4MB in the beginning and 118.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.75ms. Allocated memory is still 174.1MB. Free memory was 118.8MB in the beginning and 116.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.18ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 114.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.28ms. Allocated memory is still 174.1MB. Free memory was 114.6MB in the beginning and 102.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1105.01ms. Allocated memory is still 174.1MB. Free memory was 101.7MB in the beginning and 123.3MB in the end (delta: -21.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 10.23ms. Allocated memory is still 174.1MB. Free memory is still 123.3MB. 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: 51]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; VAL [__return_125=0, __return_main=0] [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0, main__i=0, main__max={5:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_125=0, __return_main=0] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_125=0, __return_main=0, main__i=0, main__max={5:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0, main__i=0, main__max={5:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_125=0, __return_main=0, main__i=0, main__max={5:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0, main__i=0, main__max={5:0}] [L51] reach_error() VAL [__return_125=0, __return_main=0, main__i=0, main__max={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 35 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 16:50:06,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:50:09,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:50:09,763 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:50:09,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:50:09,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:50:09,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:50:09,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:50:09,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:50:09,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:50:09,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:50:09,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:50:09,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:50:09,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:50:09,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:50:09,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:50:09,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:50:09,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:50:09,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:50:09,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:50:09,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:50:09,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:50:09,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:50:09,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:50:09,830 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:50:09,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:50:09,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:50:09,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:50:09,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:50:09,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:50:09,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:50:09,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:50:09,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:50:09,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:50:09,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:50:09,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:50:09,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:50:09,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:50:09,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:50:09,837 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:50:09,837 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:50:09,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:50:09,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:50:09,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:50:09,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:50:09,840 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_da314776-cd0a-4b74-bc05-ddcce04fdb46/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_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2024-11-08 16:50:10,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:50:10,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:50:10,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:50:10,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:50:10,374 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:50:10,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c Unable to find full path for "g++" [2024-11-08 16:50:13,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:50:13,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:50:13,367 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2024-11-08 16:50:13,379 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/data/cc8903e94/0690847b9ccd4678ac2f2c5f762430ce/FLAG354a0fe8f [2024-11-08 16:50:13,405 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/data/cc8903e94/0690847b9ccd4678ac2f2c5f762430ce [2024-11-08 16:50:13,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:50:13,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:50:13,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:50:13,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:50:13,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:50:13,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:13,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e387174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13, skipping insertion in model container [2024-11-08 16:50:13,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:13,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:50:13,819 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_da314776-cd0a-4b74-bc05-ddcce04fdb46/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2024-11-08 16:50:13,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:50:13,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:50:13,916 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_da314776-cd0a-4b74-bc05-ddcce04fdb46/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2024-11-08 16:50:13,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:50:13,955 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:50:13,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13 WrapperNode [2024-11-08 16:50:13,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:50:13,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:50:13,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:50:13,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:50:13,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:13,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,017 INFO L138 Inliner]: procedures = 19, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 111 [2024-11-08 16:50:14,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:50:14,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:50:14,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:50:14,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:50:14,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,063 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2024-11-08 16:50:14,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:50:14,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:50:14,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:50:14,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:50:14,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (1/1) ... [2024-11-08 16:50:14,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:50:14,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:50:14,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:50:14,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:50:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:50:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 16:50:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 16:50:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 16:50:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:50:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:50:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 16:50:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 16:50:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 16:50:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 16:50:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 16:50:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:50:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:50:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:50:14,327 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:50:14,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:50:16,175 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 16:50:16,175 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:50:16,193 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:50:16,193 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:50:16,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:16 BoogieIcfgContainer [2024-11-08 16:50:16,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:50:16,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:50:16,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:50:16,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:50:16,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:50:13" (1/3) ... [2024-11-08 16:50:16,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce190c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:50:16, skipping insertion in model container [2024-11-08 16:50:16,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:13" (2/3) ... [2024-11-08 16:50:16,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce190c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:50:16, skipping insertion in model container [2024-11-08 16:50:16,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:16" (3/3) ... [2024-11-08 16:50:16,214 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2024-11-08 16:50:16,236 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:50:16,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:50:16,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:50:16,327 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;@debcc00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:50:16,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:50:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:50:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 16:50:16,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:16,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:16,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:16,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2024-11-08 16:50:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:16,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337706933] [2024-11-08 16:50:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:16,372 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 16:50:16,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:16,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:50:16,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:50:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:16,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:50:16,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:16,910 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 16:50:16,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:50:16,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:50:16,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337706933] [2024-11-08 16:50:16,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337706933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:16,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:16,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:50:16,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390624440] [2024-11-08 16:50:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:16,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:50:16,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:50:16,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:50:16,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:50:16,946 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 16:50:18,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:18,558 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-11-08 16:50:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:50:18,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Word has length 12 [2024-11-08 16:50:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:18,572 INFO L225 Difference]: With dead ends: 32 [2024-11-08 16:50:18,573 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 16:50:18,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:50:18,580 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:18,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:50:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 16:50:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-08 16:50:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:50:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-08 16:50:18,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2024-11-08 16:50:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:18,629 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-08 16:50:18,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 16:50:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-08 16:50:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:50:18,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:18,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:18,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:50:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:50:18,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:18,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2024-11-08 16:50:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983835421] [2024-11-08 16:50:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:18,833 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 16:50:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:18,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:50:18,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:50:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:19,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:50:19,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:19,316 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 16:50:19,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:50:19,317 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:50:19,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983835421] [2024-11-08 16:50:19,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983835421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:19,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:19,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:50:19,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150600147] [2024-11-08 16:50:19,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:19,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:50:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:50:19,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:50:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:50:19,322 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:50:23,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:50:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:23,492 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-08 16:50:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:50:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 16:50:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:23,495 INFO L225 Difference]: With dead ends: 20 [2024-11-08 16:50:23,495 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 16:50:23,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:50:23,497 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:23,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 16:50:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 16:50:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-08 16:50:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 16:50:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-08 16:50:23,509 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2024-11-08 16:50:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:23,510 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-08 16:50:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:50:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-08 16:50:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:50:23,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:23,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:50:23,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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)] Ended with exit code 0 [2024-11-08 16:50:23,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:50:23,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:23,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2024-11-08 16:50:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:23,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504543783] [2024-11-08 16:50:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:23,716 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 16:50:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:23,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:50:23,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:50:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:24,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 16:50:24,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:26,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:50:26,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2024-11-08 16:50:26,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 51 [2024-11-08 16:51:05,779 WARN L286 SmtUtils]: Spent 15.00s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:51:17,965 WARN L286 SmtUtils]: Spent 8.15s 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 16:51:29,664 WARN L286 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:51:37,785 WARN L286 SmtUtils]: Spent 8.12s 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 16:51:45,003 WARN L286 SmtUtils]: Spent 7.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 16:51:49,031 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0)))) is different from false [2024-11-08 16:51:53,045 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0)))) is different from true [2024-11-08 16:52:05,206 WARN L286 SmtUtils]: Spent 8.14s 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 16:52:10,377 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:52:18,523 WARN L286 SmtUtils]: Spent 8.15s 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 16:52:24,930 WARN L286 SmtUtils]: Spent 6.41s 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 16:52:37,066 WARN L286 SmtUtils]: Spent 8.11s 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 16:52:49,730 WARN L286 SmtUtils]: Spent 8.11s 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 16:52:54,792 WARN L286 SmtUtils]: Spent 5.06s 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 16:53:06,965 WARN L286 SmtUtils]: Spent 8.15s 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 16:53:14,799 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 16:53:14,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:53:14,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:53:14,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504543783] [2024-11-08 16:53:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504543783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:14,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:14,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:53:14,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458702485] [2024-11-08 16:53:14,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:14,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:53:14,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:53:14,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:53:14,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=61, Unknown=2, NotChecked=16, Total=110 [2024-11-08 16:53:14,804 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:16,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:20,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:24,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:26,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:28,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:30,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:34,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:37,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:41,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:45,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:49,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:53,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:53:57,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:01,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:05,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:09,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:13,484 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-08 16:54:16,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:20,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:24,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:28,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:32,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:36,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:40,494 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 [0] [2024-11-08 16:54:44,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:48,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:51,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:54:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:54:51,975 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-08 16:54:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:54:51,979 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 16:54:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:54:51,980 INFO L225 Difference]: With dead ends: 25 [2024-11-08 16:54:51,980 INFO L226 Difference]: Without dead ends: 20 [2024-11-08 16:54:51,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=33, Invalid=62, Unknown=3, NotChecked=34, Total=132 [2024-11-08 16:54:51,981 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 93.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:54:51,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 17 Unknown, 41 Unchecked, 93.1s Time] [2024-11-08 16:54:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-08 16:54:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-08 16:54:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-08 16:54:51,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2024-11-08 16:54:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:54:51,986 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-08 16:54:51,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-08 16:54:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 16:54:51,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:54:51,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:54:51,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:54:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:54:52,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:54:52,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:54:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2024-11-08 16:54:52,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:54:52,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821779838] [2024-11-08 16:54:52,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:54:52,189 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 16:54:52,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:54:52,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:54:52,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:54:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:54:53,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 16:54:53,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:54:55,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:54:55,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2024-11-08 16:54:55,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 51 [2024-11-08 16:55:35,996 WARN L286 SmtUtils]: Spent 12.83s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:55:44,143 WARN L286 SmtUtils]: Spent 8.14s 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 16:55:51,134 WARN L286 SmtUtils]: Spent 6.99s 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 16:57:01,835 WARN L286 SmtUtils]: Spent 36.67s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:57:13,962 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:57:22,063 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:57:27,834 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:57:40,648 WARN L286 SmtUtils]: Spent 7.88s on a formula simplification. DAG size of input: 18 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:57:44,684 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_13| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1)))) is different from false [2024-11-08 16:57:48,701 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_13| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1)))) is different from true [2024-11-08 16:58:00,825 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:08,949 WARN L286 SmtUtils]: Spent 8.12s 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 16:58:14,138 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:21,314 WARN L286 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:32,672 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:58:40,785 WARN L286 SmtUtils]: Spent 8.11s 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 16:58:45,985 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:01,967 WARN L286 SmtUtils]: Spent 7.61s 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 16:59:10,082 WARN L286 SmtUtils]: Spent 8.11s 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 16:59:15,363 WARN L286 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:59:20,228 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 16:59:20,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:59:20,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:59:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821779838] [2024-11-08 16:59:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821779838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:59:20,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:59:20,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:59:20,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972958615] [2024-11-08 16:59:20,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:59:20,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:59:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:59:20,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:59:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=75, Unknown=5, NotChecked=18, Total=132 [2024-11-08 16:59:20,231 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:59:22,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:59:28,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:59:32,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:59:34,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:59:37,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:59:42,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse1) (= .cse2 .cse3) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse3) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_13| .cse3) (fp.sub c_currentRoundingMode .cse1 .cse3)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse4) (= .cse2 .cse5) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse4) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_13| .cse5) (fp.sub c_currentRoundingMode .cse4 .cse5)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-08 16:59:46,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:59:50,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:59:53,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:59:56,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:59:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:59:56,541 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-08 16:59:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:59:56,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 16:59:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:59:56,548 INFO L225 Difference]: With dead ends: 25 [2024-11-08 16:59:56,548 INFO L226 Difference]: Without dead ends: 17 [2024-11-08 16:59:56,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 105.8s TimeCoverageRelationStatistics Valid=36, Invalid=76, Unknown=6, NotChecked=38, Total=156 [2024-11-08 16:59:56,549 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:59:56,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 62 Unchecked, 32.1s Time] [2024-11-08 16:59:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-08 16:59:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-08 16:59:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:59:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-08 16:59:56,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2024-11-08 16:59:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:59:56,555 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-08 16:59:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:59:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-08 16:59:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 16:59:56,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:59:56,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:59:56,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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)] Ended with exit code 0 [2024-11-08 16:59:56,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:59:56,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:59:56,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:59:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 392786167, now seen corresponding path program 1 times [2024-11-08 16:59:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:59:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982736726] [2024-11-08 16:59:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:59:56,758 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 16:59:56,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:59:56,759 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 16:59:56,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 (6)] Waiting until timeout for monitored process [2024-11-08 16:59:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:59:57,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:59:57,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:59:57,195 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 16:59:57,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:59:57,334 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 16:59:57,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:59:57,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982736726] [2024-11-08 16:59:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982736726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:59:57,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:59:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-08 16:59:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250144270] [2024-11-08 16:59:57,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:59:57,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:59:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:59:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:59:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:59:57,337 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 17:00:01,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:00:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:00:01,318 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-08 17:00:01,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:00:01,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 17:00:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:00:01,322 INFO L225 Difference]: With dead ends: 33 [2024-11-08 17:00:01,322 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 17:00:01,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:00:01,323 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:00:01,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 37 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 17:00:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 17:00:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-08 17:00:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 17:00:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-08 17:00:01,329 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2024-11-08 17:00:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:00:01,330 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-08 17:00:01,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 17:00:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-08 17:00:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 17:00:01,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:00:01,333 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:00:01,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 (6)] Ended with exit code 0 [2024-11-08 17:00:01,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 17:00:01,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:00:01,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:00:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 467686415, now seen corresponding path program 1 times [2024-11-08 17:00:01,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:00:01,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205039165] [2024-11-08 17:00:01,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:00:01,535 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 17:00:01,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:00:01,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 17:00:01,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da314776-cd0a-4b74-bc05-ddcce04fdb46/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 (7)] Waiting until timeout for monitored process [2024-11-08 17:00:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:00:01,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:00:01,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:00:05,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:00:05,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 107 [2024-11-08 17:00:05,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 42 [2024-11-08 17:00:55,844 WARN L286 SmtUtils]: Spent 20.21s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:00:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:00:58,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:01:11,592 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:15,633 WARN L851 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2024-11-08 17:01:19,665 WARN L873 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2024-11-08 17:01:27,785 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:35,850 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:01:39,881 WARN L851 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from false [2024-11-08 17:01:53,965 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:01,371 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ +zero 11 53))))) is different from true [2024-11-08 17:02:13,406 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:20,698 WARN L286 SmtUtils]: Spent 7.29s 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 17:02:24,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2024-11-08 17:02:35,260 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:43,299 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:02:50,613 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse1 (let ((.cse6 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse3)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2024-11-08 17:02:58,744 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:06,861 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:14,012 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:18,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse5 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53))))) is different from false [2024-11-08 17:03:22,080 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse5 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53))))) is different from true [2024-11-08 17:03:31,501 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:36,933 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:45,000 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:03:49,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse5 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.sub c_currentRoundingMode .cse2 .cse3)))) (_ +zero 11 53))))) is different from false [2024-11-08 17:03:56,600 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:03,893 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:12,018 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:20,151 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:28,224 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:04:32,273 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem5#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse6 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_#t~mem5#1|)))))) is different from true [2024-11-08 17:04:35,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:04:35,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 206 treesize of output 1 [2024-11-08 17:04:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 17:04:35,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:04:35,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205039165] [2024-11-08 17:04:35,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205039165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:04:35,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:04:35,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-11-08 17:04:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318671054] [2024-11-08 17:04:35,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:04:35,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 17:04:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:04:35,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 17:04:35,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=114, Unknown=10, NotChecked=232, Total=420 [2024-11-08 17:04:35,704 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 17:04:37,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:04:38,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:04:43,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2) (= (let ((.cse3 (select .cse1 (_ bv16 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (forall ((|ULTIMATE.start_main_#t~mem5#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 (let ((.cse10 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (let ((.cse6 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse5 .cse4)))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse9 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_#t~mem5#1|))))) (= .cse2 (let ((.cse11 (select .cse7 (_ bv4 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) (let ((.cse12 (select .cse1 (_ bv4 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-08 17:04:47,177 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2) (= (let ((.cse3 (select .cse1 (_ bv16 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (forall ((|ULTIMATE.start_main_#t~mem5#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 (let ((.cse10 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (let ((.cse6 (select .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub c_currentRoundingMode .cse5 .cse4)))) (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse9 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_#t~mem5#1|))))) (= .cse2 (let ((.cse11 (select .cse7 (_ bv4 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) (let ((.cse12 (select .cse1 (_ bv4 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-08 17:05:02,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:05:09,464 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (let ((.cse12 (select .cse1 (_ bv16 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= .cse2 (let ((.cse4 (select .cse5 (_ bv4 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (let ((.cse7 (let ((.cse10 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse7)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse8 (let ((.cse9 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse8) (fp.sub c_currentRoundingMode .cse7 .cse8)))) (_ +zero 11 53)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) (let ((.cse11 (select .cse1 (_ bv4 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (exists ((|v_ULTIMATE.start_main_#t~mem5#1_10| (_ FloatingPoint 8 24))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| |v_ULTIMATE.start_main_#t~mem5#1_10|)) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-08 17:05:15,672 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (let ((.cse13 (select .cse1 (_ bv16 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= .cse2 (let ((.cse4 (select .cse5 (_ bv4 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~main__i~0#1|) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) (let ((.cse6 (select .cse1 (_ bv4 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (exists ((|v_ULTIMATE.start_main_#t~mem5#1_10| (_ FloatingPoint 8 24))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| |v_ULTIMATE.start_main_#t~mem5#1_10|)) (let ((.cse10 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse8 (let ((.cse12 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse10)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse7 (let ((.cse9 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse10)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse7) (fp.sub c_currentRoundingMode .cse8 .cse7)))) (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse11 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse10)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse8))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-08 17:05:22,047 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse9 (let ((.cse13 (select .cse6 (_ bv16 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse7 (let ((.cse12 (select .cse6 (_ bv0 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (and (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse1 (let ((.cse5 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) (= .cse7 .cse8) (= .cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= .cse8 (let ((.cse10 (select .cse3 (_ bv4 32)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~main__i~0#1|) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse9) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) (let ((.cse11 (select .cse6 (_ bv4 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (exists ((|v_ULTIMATE.start_main_#t~mem5#1_10| (_ FloatingPoint 8 24))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| |v_ULTIMATE.start_main_#t~mem5#1_10|)) (= .cse7 |c_ULTIMATE.start_main_#t~mem7#1|) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-08 17:05:26,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse13 (select .cse10 (_ bv0 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse2 (let ((.cse12 (select .cse10 (_ bv16 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (and (= (_ bv1 32) |c_ULTIMATE.start_main_~main__i~0#1|) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= .cse1 (let ((.cse3 (select .cse4 (_ bv4 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (let ((.cse8 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse5 (let ((.cse9 (select .cse10 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse5)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse6 (let ((.cse7 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)))) (_ +zero 11 53))))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) (let ((.cse11 (select .cse10 (_ bv4 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (exists ((|v_ULTIMATE.start_main_#t~mem5#1_10| (_ FloatingPoint 8 24))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| |v_ULTIMATE.start_main_#t~mem5#1_10|)) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false