./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/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_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:01:05,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:01:05,824 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:01:05,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:01:05,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:01:05,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:01:05,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:01:05,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:01:05,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:01:05,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:01:05,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:01:05,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:01:05,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:01:05,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:01:05,863 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:01:05,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:01:05,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:01:05,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:01:05,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:01:05,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:01:05,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:01:05,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:01:05,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:01:05,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:01:05,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:01:05,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:01:05,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:01:05,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:01:05,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:01:05,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:05,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:05,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:05,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:05,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:01:05,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:05,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:05,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:05,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:05,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:01:05,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:01:05,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:01:05,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:01:05,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:01:05,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:01:05,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:01:05,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:01:05,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:01:05,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:01:05,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2024-11-24 01:01:06,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:01:06,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:01:06,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:01:06,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:01:06,232 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:01:06,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2024-11-24 01:01:09,679 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data/017a68ad4/53d517c22b534a2ab1a407c5146518c8/FLAG20b3bf1b3 [2024-11-24 01:01:09,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:01:09,964 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2024-11-24 01:01:09,981 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data/017a68ad4/53d517c22b534a2ab1a407c5146518c8/FLAG20b3bf1b3 [2024-11-24 01:01:10,004 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data/017a68ad4/53d517c22b534a2ab1a407c5146518c8 [2024-11-24 01:01:10,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:01:10,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:01:10,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:10,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:01:10,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:01:10,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12798aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10, skipping insertion in model container [2024-11-24 01:01:10,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:01:10,249 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_64b835ea-11ce-4c01-a814-d25743928393/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2024-11-24 01:01:10,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:10,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:01:10,312 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_64b835ea-11ce-4c01-a814-d25743928393/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2024-11-24 01:01:10,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:10,347 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:01:10,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10 WrapperNode [2024-11-24 01:01:10,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:10,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:10,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:01:10,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:01:10,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,403 INFO L138 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 110 [2024-11-24 01:01:10,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:10,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:01:10,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:01:10,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:01:10,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,449 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-24 01:01:10,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:01:10,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:01:10,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:01:10,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:01:10,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (1/1) ... [2024-11-24 01:01:10,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:10,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:01:10,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:01:10,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:01:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:01:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:01:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 01:01:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-24 01:01:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-24 01:01:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-24 01:01:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-24 01:01:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-24 01:01:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:01:10,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:01:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-24 01:01:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-24 01:01:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-24 01:01:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 01:01:10,664 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:01:10,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:01:10,900 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-24 01:01:10,902 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:01:10,918 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:01:10,919 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 01:01:10,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:10 BoogieIcfgContainer [2024-11-24 01:01:10,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:01:10,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:01:10,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:01:10,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:01:10,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:01:10" (1/3) ... [2024-11-24 01:01:10,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2511fe94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:10, skipping insertion in model container [2024-11-24 01:01:10,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:10" (2/3) ... [2024-11-24 01:01:10,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2511fe94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:10, skipping insertion in model container [2024-11-24 01:01:10,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:10" (3/3) ... [2024-11-24 01:01:10,943 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2024-11-24 01:01:10,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:01:10,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c.v+cfa-reducer.c that has 1 procedures, 18 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-24 01:01:11,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:01:11,069 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;@67659fb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:01:11,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:01:11,076 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-24 01:01:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-24 01:01:11,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:11,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:11,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:11,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2024-11-24 01:01:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327634187] [2024-11-24 01:01:11,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:01:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:11,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327634187] [2024-11-24 01:01:11,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327634187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:11,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:01:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031671506] [2024-11-24 01:01:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:11,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:01:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:11,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:01:11,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:01:11,627 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-24 01:01:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:11,707 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-11-24 01:01:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:01:11,709 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-24 01:01:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:11,718 INFO L225 Difference]: With dead ends: 25 [2024-11-24 01:01:11,718 INFO L226 Difference]: Without dead ends: 15 [2024-11-24 01:01:11,724 INFO L434 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-24 01:01:11,729 INFO L435 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.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:11,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:01:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-24 01:01:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-24 01:01:11,763 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-24 01:01:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-24 01:01:11,774 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2024-11-24 01:01:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:11,775 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-24 01:01:11,775 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-24 01:01:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-24 01:01:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-24 01:01:11,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:11,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:11,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:01:11,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:11,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1736001843, now seen corresponding path program 1 times [2024-11-24 01:01:11,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:11,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290861383] [2024-11-24 01:01:11,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:11,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:01:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:01:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290861383] [2024-11-24 01:01:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290861383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:01:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466315810] [2024-11-24 01:01:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:01:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:01:12,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:01:12,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:01:12,003 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-24 01:01:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:12,033 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-24 01:01:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:01:12,034 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-24 01:01:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:12,035 INFO L225 Difference]: With dead ends: 33 [2024-11-24 01:01:12,035 INFO L226 Difference]: Without dead ends: 25 [2024-11-24 01:01:12,035 INFO L434 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-24 01:01:12,036 INFO L435 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-24 01:01:12,037 INFO L436 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-24 01:01:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-24 01:01:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2024-11-24 01:01:12,048 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-24 01:01:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-24 01:01:12,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2024-11-24 01:01:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:12,049 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-24 01:01:12,049 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-24 01:01:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-24 01:01:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 01:01:12,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:12,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:12,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:01:12,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:12,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2024-11-24 01:01:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:01:12,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521063773] [2024-11-24 01:01:12,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:12,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:01:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:01:12,097 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:01:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:01:12,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:01:12,152 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:01:12,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:01:12,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:01:12,161 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-24 01:01:12,194 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:01:12,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:01:12 BoogieIcfgContainer [2024-11-24 01:01:12,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:01:12,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:01:12,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:01:12,199 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:01:12,200 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:10" (3/4) ... [2024-11-24 01:01:12,203 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:01:12,204 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:01:12,205 INFO L158 Benchmark]: Toolchain (without parser) took 2195.95ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 55.8MB in the end (delta: 60.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-24 01:01:12,206 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.2MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:01:12,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.59ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 105.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:01:12,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.07ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 103.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:01:12,207 INFO L158 Benchmark]: Boogie Preprocessor took 66.80ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 101.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:01:12,207 INFO L158 Benchmark]: RCFGBuilder took 447.78ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 90.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:01:12,208 INFO L158 Benchmark]: TraceAbstraction took 1271.19ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 56.1MB in the end (delta: 34.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 01:01:12,208 INFO L158 Benchmark]: Witness Printer took 5.24ms. Allocated memory is still 142.6MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:01:12,210 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.38ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.2MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.59ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 105.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.07ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 103.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.80ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 101.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 447.78ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 90.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1271.19ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 56.1MB in the end (delta: 34.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 5.24ms. Allocated memory is still 142.6MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryFLOATComparisonOperation at line 24, overapproximation of someBinaryFLOATComparisonOperation at line 22, 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.1s, 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.1s 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.5s 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 01:01:12,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/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_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:01:15,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:01:15,496 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:01:15,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:01:15,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:01:15,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:01:15,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:01:15,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:01:15,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:01:15,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:01:15,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:01:15,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:01:15,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:01:15,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:01:15,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:01:15,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:01:15,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:01:15,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:01:15,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:01:15,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:01:15,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:01:15,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:01:15,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:01:15,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:15,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:15,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:15,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:15,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:01:15,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:01:15,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:15,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:01:15,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:01:15,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:01:15,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:01:15,557 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2024-11-24 01:01:15,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:01:15,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:01:15,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:01:15,972 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:01:15,973 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:01:15,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2024-11-24 01:01:19,539 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data/8ec5d3dd1/56fc1b1cd82c43faa6c120ccb864dce0/FLAG0aba5da86 [2024-11-24 01:01:19,842 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:01:19,843 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2024-11-24 01:01:19,851 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data/8ec5d3dd1/56fc1b1cd82c43faa6c120ccb864dce0/FLAG0aba5da86 [2024-11-24 01:01:19,870 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/data/8ec5d3dd1/56fc1b1cd82c43faa6c120ccb864dce0 [2024-11-24 01:01:19,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:01:19,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:01:19,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:19,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:01:19,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:01:19,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:19" (1/1) ... [2024-11-24 01:01:19,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8259d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:19, skipping insertion in model container [2024-11-24 01:01:19,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:01:19" (1/1) ... [2024-11-24 01:01:19,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:01:20,160 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_64b835ea-11ce-4c01-a814-d25743928393/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2024-11-24 01:01:20,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:20,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:01:20,236 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_64b835ea-11ce-4c01-a814-d25743928393/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2024-11-24 01:01:20,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:01:20,277 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:01:20,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20 WrapperNode [2024-11-24 01:01:20,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:01:20,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:20,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:01:20,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:01:20,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,340 INFO L138 Inliner]: procedures = 19, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 111 [2024-11-24 01:01:20,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:01:20,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:01:20,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:01:20,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:01:20,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,383 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-24 01:01:20,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:01:20,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:01:20,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:01:20,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:01:20,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (1/1) ... [2024-11-24 01:01:20,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:01:20,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:01:20,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:01:20,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:01:20,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:01:20,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-24 01:01:20,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-24 01:01:20,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:01:20,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:01:20,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 01:01:20,605 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:01:20,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:01:22,891 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-24 01:01:22,891 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:01:22,901 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:01:22,901 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 01:01:22,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:22 BoogieIcfgContainer [2024-11-24 01:01:22,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:01:22,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:01:22,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:01:22,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:01:22,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:01:19" (1/3) ... [2024-11-24 01:01:22,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547c57ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:22, skipping insertion in model container [2024-11-24 01:01:22,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:01:20" (2/3) ... [2024-11-24 01:01:22,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547c57ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:01:22, skipping insertion in model container [2024-11-24 01:01:22,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:01:22" (3/3) ... [2024-11-24 01:01:22,917 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2024-11-24 01:01:22,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:01:22,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c.v+cfa-reducer.c that has 1 procedures, 18 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-24 01:01:23,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:01:23,038 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;@1cea490e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:01:23,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:01:23,043 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-24 01:01:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-24 01:01:23,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:23,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:23,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:23,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:23,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2024-11-24 01:01:23,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:01:23,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115760350] [2024-11-24 01:01:23,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:01:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:01:23,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:01:23,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-24 01:01:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:23,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:01:23,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:01:23,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:01:23,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:01:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115760350] [2024-11-24 01:01:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115760350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:23,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:23,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:01:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612589275] [2024-11-24 01:01:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:01:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:01:23,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:01:23,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:01:23,649 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-24 01:01:27,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:27,298 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-11-24 01:01:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:01:27,303 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-24 01:01:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:27,315 INFO L225 Difference]: With dead ends: 32 [2024-11-24 01:01:27,316 INFO L226 Difference]: Without dead ends: 18 [2024-11-24 01:01:27,320 INFO L434 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-24 01:01:27,325 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 3.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:27,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-24 01:01:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-24 01:01:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-24 01:01:27,353 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-24 01:01:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-24 01:01:27,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2024-11-24 01:01:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:27,360 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-24 01:01:27,360 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-24 01:01:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-24 01:01:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 01:01:27,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:27,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:27,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-24 01:01:27,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:01:27,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:27,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2024-11-24 01:01:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:01:27,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290767695] [2024-11-24 01:01:27,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:27,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:01:27,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:01:27,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:01:27,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-24 01:01:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:27,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:01:27,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:01:28,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:01:28,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:01:28,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290767695] [2024-11-24 01:01:28,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290767695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:01:28,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:01:28,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:01:28,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987301399] [2024-11-24 01:01:28,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:01:28,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:01:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:01:28,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:01:28,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:01:28,082 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-24 01:01:32,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:01:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:01:32,080 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-24 01:01:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:01:32,081 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-24 01:01:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:01:32,082 INFO L225 Difference]: With dead ends: 20 [2024-11-24 01:01:32,082 INFO L226 Difference]: Without dead ends: 16 [2024-11-24 01:01:32,082 INFO L434 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-24 01:01:32,083 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:01:32,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-24 01:01:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-24 01:01:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-24 01:01:32,086 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-24 01:01:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-24 01:01:32,087 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2024-11-24 01:01:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:01:32,088 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-24 01:01:32,088 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-24 01:01:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-24 01:01:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-24 01:01:32,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:01:32,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:01:32,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-24 01:01:32,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:01:32,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:01:32,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:01:32,291 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2024-11-24 01:01:32,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:01:32,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684777178] [2024-11-24 01:01:32,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:01:32,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:01:32,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:01:32,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:01:32,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-24 01:01:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:01:32,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-24 01:01:32,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:01:34,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:01:34,866 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-24 01:01:34,900 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-24 01:02:23,058 WARN L286 SmtUtils]: Spent 17.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-24 01:02:35,195 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:02:40,880 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:02:48,974 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:02:57,079 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:03:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:03:00,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:03:00,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:03:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684777178] [2024-11-24 01:03:00,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684777178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:03:00,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:03:00,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 01:03:00,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832127814] [2024-11-24 01:03:00,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:03:00,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:03:00,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:03:00,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:03:00,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:03:00,053 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:03:02,723 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-24 01:03:04,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:06,857 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-24 01:03:08,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:10,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:12,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:03:17,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:19,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:21,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:26,095 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 [0] [2024-11-24 01:03:30,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:34,209 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-24 01:03:38,213 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-24 01:03:42,217 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-24 01:03:46,220 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-24 01:03:50,225 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-24 01:03:54,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:58,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:03:59,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:04:01,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:04:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:04:02,304 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-24 01:04:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:04:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-24 01:04:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:04:02,308 INFO L225 Difference]: With dead ends: 25 [2024-11-24 01:04:02,308 INFO L226 Difference]: Without dead ends: 20 [2024-11-24 01:04:02,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:04:02,309 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:04:02,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 62.2s Time] [2024-11-24 01:04:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-24 01:04:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-24 01:04:02,313 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-24 01:04:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-24 01:04:02,314 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2024-11-24 01:04:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:04:02,314 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-24 01:04:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:04:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-24 01:04:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-24 01:04:02,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:04:02,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:04:02,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-24 01:04:02,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:04:02,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:04:02,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:04:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2024-11-24 01:04:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:04:02,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728325503] [2024-11-24 01:04:02,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:04:02,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:04:02,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:04:02,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:04:02,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-24 01:04:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:04:03,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-24 01:04:03,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:04:05,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:04:05,520 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-24 01:04:05,551 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-24 01:04:11,037 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:04:16,296 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:05:04,326 WARN L286 SmtUtils]: Spent 20.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-24 01:05:10,201 WARN L286 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:05:16,826 WARN L286 SmtUtils]: Spent 6.62s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:05:30,883 WARN L851 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (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 ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse0) (= |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| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-24 01:05:43,135 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:05:51,246 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-24 01:05:57,515 WARN L286 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:06:02,683 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:06:10,759 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:06:14,787 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 ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (let ((.cse2 ((_ 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))))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1) (fp.geq .cse2 (_ +zero 11 53)))))) is different from false [2024-11-24 01:06:18,810 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 ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (let ((.cse2 ((_ 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))))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1) (fp.geq .cse2 (_ +zero 11 53)))))) is different from true [2024-11-24 01:06:30,939 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:06:39,044 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:06:50,352 WARN L286 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:06:58,421 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:07:10,551 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:07:17,723 WARN L286 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:07:24,106 WARN L286 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:07:30,671 WARN L286 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:07:38,745 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:07:50,884 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-24 01:07:59,029 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-24 01:08:06,581 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:08:11,597 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:08:19,668 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:08:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:08:19,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:08:19,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:08:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728325503] [2024-11-24 01:08:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728325503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:08:19,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:08:19,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:08:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677934693] [2024-11-24 01:08:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:08:19,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:08:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:08:19,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:08:19,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=62, Unknown=3, NotChecked=34, Total=132 [2024-11-24 01:08:19,671 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-24 01:08:21,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:23,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:25,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:27,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:28,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:30,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:31,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:33,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:08:38,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:40,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:41,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:44,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:48,389 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-24 01:08:52,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:54,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:08:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:08:56,010 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-24 01:08:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:08:56,014 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-24 01:08:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:08:56,015 INFO L225 Difference]: With dead ends: 25 [2024-11-24 01:08:56,015 INFO L226 Difference]: Without dead ends: 17 [2024-11-24 01:08:56,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 62.0s TimeCoverageRelationStatistics Valid=35, Invalid=63, Unknown=4, NotChecked=54, Total=156 [2024-11-24 01:08:56,017 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:08:56,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 41 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 2 Unknown, 83 Unchecked, 32.1s Time] [2024-11-24 01:08:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-24 01:08:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-24 01:08:56,023 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-24 01:08:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-24 01:08:56,024 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2024-11-24 01:08:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:08:56,025 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-24 01:08:56,025 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-24 01:08:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-24 01:08:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-24 01:08:56,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:08:56,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:08:56,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-24 01:08:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:08:56,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:08:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:08:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 392786167, now seen corresponding path program 1 times [2024-11-24 01:08:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:08:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508262213] [2024-11-24 01:08:56,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:08:56,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:08:56,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:08:56,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:08:56,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-24 01:08:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:08:56,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 01:08:56,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:08:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:08:56,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:08:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:08:56,915 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:08:56,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508262213] [2024-11-24 01:08:56,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508262213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:08:56,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:08:56,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-24 01:08:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894272571] [2024-11-24 01:08:56,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:08:56,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:08:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:08:56,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:08:56,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:08:56,917 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-24 01:09:01,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:03,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:09:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:09:03,440 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-24 01:09:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:09:03,441 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-24 01:09:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:09:03,442 INFO L225 Difference]: With dead ends: 33 [2024-11-24 01:09:03,443 INFO L226 Difference]: Without dead ends: 25 [2024-11-24 01:09:03,443 INFO L434 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-24 01:09:03,444 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:09:03,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 37 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-11-24 01:09:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-24 01:09:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-24 01:09:03,448 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-24 01:09:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-24 01:09:03,451 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2024-11-24 01:09:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:09:03,451 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-24 01:09:03,452 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-24 01:09:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-24 01:09:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-24 01:09:03,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:09:03,452 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:09:03,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-24 01:09:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:09:03,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:09:03,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:09:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 467686415, now seen corresponding path program 1 times [2024-11-24 01:09:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:09:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440939305] [2024-11-24 01:09:03,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:09:03,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:09:03,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:09:03,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:09:03,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-24 01:09:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:09:03,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-24 01:09:03,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:09:07,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:09:07,674 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-24 01:09:07,718 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-24 01:09:13,955 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:09:21,408 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:09:58,869 WARN L286 SmtUtils]: Spent 19.18s 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-24 01:10:06,899 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-24 01:10:06,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:10:20,388 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-24 01:10:24,418 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-24 01:10:28,448 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-24 01:10:36,562 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:10:44,624 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-24 01:10:52,570 WARN L873 $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 true [2024-11-24 01:10:58,639 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:11:06,703 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-24 01:11:10,733 WARN L851 $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 false [2024-11-24 01:11:14,763 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-24 01:11:22,433 WARN L286 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:11:30,500 WARN L286 SmtUtils]: Spent 8.07s 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-24 01:11:38,626 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:11:42,657 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-24 01:11:46,689 WARN L873 $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 true [2024-11-24 01:11:54,855 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:12:02,931 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:12:11,000 WARN L286 SmtUtils]: Spent 8.07s 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-24 01:12:15,033 WARN L851 $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 false [2024-11-24 01:12:19,066 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-24 01:12:25,077 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:12:33,950 WARN L286 SmtUtils]: Spent 7.20s 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-24 01:12:41,270 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-24 01:12:49,408 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:12:57,038 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:13:05,137 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:13:13,191 WARN L286 SmtUtils]: Spent 8.05s 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-24 01:13:17,224 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-24 01:13:21,256 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| |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 true [2024-11-24 01:13:28,512 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:13:36,626 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:13:49,072 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:13:57,140 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-24 01:14:01,179 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-24 01:14:05,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:14:05,045 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-24 01:14:05,046 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-24 01:14:05,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:14:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440939305] [2024-11-24 01:14:05,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440939305] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:14:05,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 01:14:05,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-11-24 01:14:05,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592664112] [2024-11-24 01:14:05,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 01:14:05,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-24 01:14:05,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:14:05,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-24 01:14:05,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=111, Unknown=14, NotChecked=232, Total=420 [2024-11-24 01:14:05,048 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-24 01:14:06,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:14:07,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:14:14,926 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-24 01:14:18,954 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 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse3 (let ((.cse12 (select .cse1 (_ bv16 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 ((.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)))) (= ((_ 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)))) (let ((.cse8 (let ((.cse11 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse7 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (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| .cse8)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse9 (let ((.cse10 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse9) (fp.sub c_currentRoundingMode .cse8 .cse9)))) (_ +zero 11 53)))) (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|)) (= .cse3 |c_ULTIMATE.start_main_#t~mem6#1|) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-24 01:14:22,990 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))) (.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse3 (let ((.cse12 (select .cse1 (_ bv16 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 ((.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)))) (= ((_ 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)))) (let ((.cse8 (let ((.cse11 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse7 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (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| .cse8)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse9 (let ((.cse10 (select .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse9) (fp.sub c_currentRoundingMode .cse8 .cse9)))) (_ +zero 11 53)))) (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|)) (= .cse3 |c_ULTIMATE.start_main_#t~mem6#1|) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-24 01:15:29,880 WARN L286 SmtUtils]: Spent 14.23s on a formula simplification. DAG size of input: 79 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 01:15:31,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:15:37,981 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-24 01:15:42,021 WARN L851 $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 false [2024-11-24 01:15:49,839 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 [2024-11-24 01:15:53,948 WARN L873 $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 true [2024-11-24 01:16:01,910 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse13 (select .cse4 (_ bv0 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse8 (let ((.cse12 (select .cse4 (_ bv16 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse10 (let ((.cse11 (select .cse4 (_ bv4 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (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) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse2 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse5)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub c_currentRoundingMode (let ((.cse3 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse5)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) .cse2))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= .cse1 (let ((.cse9 (select .cse7 (_ bv4 32)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse8) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) .cse10) (= .cse10 |c_ULTIMATE.start_main_#t~mem7#1|) (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-24 01:16:05,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse12 (select .cse4 (_ bv0 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse1 (let ((.cse11 (select .cse4 (_ bv4 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (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)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse0 .cse2) (= (let ((.cse3 (select .cse4 (_ bv16 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse5 (let ((.cse8 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse7)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse5) (fp.sub c_currentRoundingMode (let ((.cse6 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse7)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) .cse5))))) (_ +zero 11 53)) (= .cse2 (let ((.cse10 (select .cse9 (_ bv4 32)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)) .cse1) (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 [2024-11-24 01:16:12,910 WARN L851 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_14| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~mem5#1_10| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 .cse1) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_14| .cse2) (fp.sub c_currentRoundingMode .cse3 .cse2)) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_14| .cse3) (= .cse1 .cse2) (not (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_14| .cse0)) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_14| |v_ULTIMATE.start_main_#t~mem5#1_10|) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))))) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-24 01:16:17,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:16:21,936 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 [] [2024-11-24 01:16:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:16:22,929 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-24 01:16:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:16:22,931 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 15 [2024-11-24 01:16:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:16:22,931 INFO L225 Difference]: With dead ends: 30 [2024-11-24 01:16:22,931 INFO L226 Difference]: Without dead ends: 25 [2024-11-24 01:16:22,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 226.3s TimeCoverageRelationStatistics Valid=84, Invalid=130, Unknown=32, NotChecked=624, Total=870 [2024-11-24 01:16:22,933 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:16:22,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 1 Unknown, 292 Unchecked, 13.8s Time] [2024-11-24 01:16:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-24 01:16:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-24 01:16:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:16:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-24 01:16:22,937 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2024-11-24 01:16:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:16:22,937 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-24 01:16:22,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-24 01:16:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-24 01:16:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 01:16:22,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:16:22,938 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:16:22,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-24 01:16:23,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:16:23,139 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:16:23,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:16:23,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1096530036, now seen corresponding path program 1 times [2024-11-24 01:16:23,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:16:23,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282909320] [2024-11-24 01:16:23,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:16:23,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:16:23,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:16:23,141 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:16:23,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64b835ea-11ce-4c01-a814-d25743928393/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-24 01:16:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:16:23,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-24 01:16:23,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:16:27,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:16:27,499 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-24 01:16:27,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:16:27,575 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 101 treesize of output 53