./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd --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 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:20:36,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:20:36,924 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:20:36,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:20:36,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:20:36,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:20:36,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:20:36,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:20:36,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:20:36,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:20:36,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:20:36,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:20:36,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:20:36,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:20:36,988 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:20:36,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:20:36,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:20:36,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:20:36,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:20:36,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:20:36,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:20:36,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:20:36,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:20:36,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:20:36,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:20:36,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:20:36,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:20:36,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:20:36,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:20:36,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:20:36,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:20:36,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:20:36,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:20:36,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:20:36,993 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_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2024-11-13 16:20:37,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:20:37,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:20:37,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:20:37,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:20:37,432 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:20:37,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c Unable to find full path for "g++" [2024-11-13 16:20:39,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:20:40,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:20:40,282 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2024-11-13 16:20:40,292 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/data/9ba564d22/726f485089eb427dab1fa7ddf79e318b/FLAGd86ea2afc [2024-11-13 16:20:40,312 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/data/9ba564d22/726f485089eb427dab1fa7ddf79e318b [2024-11-13 16:20:40,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:20:40,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:20:40,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:20:40,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:20:40,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:20:40,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756a1540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40, skipping insertion in model container [2024-11-13 16:20:40,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:20:40,570 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_709a8c0c-231a-4738-8f78-40f775c1d3fd/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2024-11-13 16:20:40,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:20:40,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:20:40,625 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_709a8c0c-231a-4738-8f78-40f775c1d3fd/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2024-11-13 16:20:40,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:20:40,661 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:20:40,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40 WrapperNode [2024-11-13 16:20:40,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:20:40,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:20:40,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:20:40,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:20:40,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,707 INFO L138 Inliner]: procedures = 18, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2024-11-13 16:20:40,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:20:40,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:20:40,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:20:40,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:20:40,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,738 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-13 16:20:40,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:20:40,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:20:40,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:20:40,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:20:40,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (1/1) ... [2024-11-13 16:20:40,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:20:40,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:40,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:40,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:20:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:20:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:20:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:20:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:20:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:20:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 16:20:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 16:20:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 16:20:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:20:40,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:20:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 16:20:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 16:20:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 16:20:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:20:41,019 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:20:41,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:20:41,283 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-13 16:20:41,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:20:41,300 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:20:41,300 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 16:20:41,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:20:41 BoogieIcfgContainer [2024-11-13 16:20:41,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:20:41,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:20:41,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:20:41,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:20:41,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:20:40" (1/3) ... [2024-11-13 16:20:41,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2783d333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:20:41, skipping insertion in model container [2024-11-13 16:20:41,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:40" (2/3) ... [2024-11-13 16:20:41,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2783d333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:20:41, skipping insertion in model container [2024-11-13 16:20:41,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:20:41" (3/3) ... [2024-11-13 16:20:41,318 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2024-11-13 16:20:41,340 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:20:41,342 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c.p+cfa-reducer.c that has 1 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 16:20:41,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:20:41,454 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;@6462d671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:20:41,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:20:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-13 16:20:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 16:20:41,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:41,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:20:41,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:41,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2024-11-13 16:20:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:20:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534797103] [2024-11-13 16:20:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:20:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:41,906 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-13 16:20:41,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:20:41,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534797103] [2024-11-13 16:20:41,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534797103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:20:41,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:20:41,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:20:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586711595] [2024-11-13 16:20:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:41,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:20:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:20:41,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:20:41,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:20:41,942 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) 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-13 16:20:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:42,022 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-11-13 16:20:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:20:42,025 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-13 16:20:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:42,038 INFO L225 Difference]: With dead ends: 27 [2024-11-13 16:20:42,038 INFO L226 Difference]: Without dead ends: 17 [2024-11-13 16:20:42,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:20:42,048 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:42,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:20:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-13 16:20:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-13 16:20:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-13 16:20:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-13 16:20:42,089 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12 [2024-11-13 16:20:42,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:42,090 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-13 16:20:42,091 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-13 16:20:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-11-13 16:20:42,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 16:20:42,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:42,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:20:42,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:20:42,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 100932019, now seen corresponding path program 1 times [2024-11-13 16:20:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:20:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283751132] [2024-11-13 16:20:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:20:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:42,297 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-13 16:20:42,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:20:42,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283751132] [2024-11-13 16:20:42,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283751132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:20:42,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:20:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:20:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031390771] [2024-11-13 16:20:42,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:42,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:20:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:20:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:20:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:20:42,301 INFO L87 Difference]: Start difference. First operand 16 states and 20 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-13 16:20:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:42,321 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-11-13 16:20:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:20:42,322 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-13 16:20:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:42,322 INFO L225 Difference]: With dead ends: 34 [2024-11-13 16:20:42,323 INFO L226 Difference]: Without dead ends: 26 [2024-11-13 16:20:42,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:20:42,324 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 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-13 16:20:42,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:20:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-13 16:20:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2024-11-13 16:20:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-13 16:20:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-13 16:20:42,329 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2024-11-13 16:20:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:42,330 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-13 16:20:42,330 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-13 16:20:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-13 16:20:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:20:42,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:42,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:20:42,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:20:42,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2024-11-13 16:20:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:20:42,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801166174] [2024-11-13 16:20:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:20:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:20:42,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:20:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:20:42,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:20:42,405 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:20:42,406 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 16:20:42,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:20:42,412 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 16:20:42,439 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:20:42,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:20:42 BoogieIcfgContainer [2024-11-13 16:20:42,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:20:42,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:20:42,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:20:42,445 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:20:42,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:20:41" (3/4) ... [2024-11-13 16:20:42,449 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:20:42,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:20:42,451 INFO L158 Benchmark]: Toolchain (without parser) took 2135.12ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 45.1MB in the end (delta: 60.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-13 16:20:42,451 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:20:42,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.15ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:20:42,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.75ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:20:42,453 INFO L158 Benchmark]: Boogie Preprocessor took 64.16ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:20:42,453 INFO L158 Benchmark]: RCFGBuilder took 524.48ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 79.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:20:42,454 INFO L158 Benchmark]: TraceAbstraction took 1140.16ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 45.1MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 16:20:42,454 INFO L158 Benchmark]: Witness Printer took 5.45ms. Allocated memory is still 142.6MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:20:42,456 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.35ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.15ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.75ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.16ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 524.48ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 79.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1140.16ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 45.1MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 5.45ms. Allocated memory is still 142.6MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 21, overapproximation of someBinaryFLOATComparisonOperation at line 23, overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; [L21] EXPR main__min[0] VAL [__return_main=0] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__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_main=0, main__i=0, main__max={5:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__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_main=0, main__i=0, main__max={5:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0, main__i=0, main__max={5:0}] [L63] main____CPAchecker_TMP_1 = 0 VAL [__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_main=0, main__i=0, main__max={5:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0, main__max={5:0}] [L51] reach_error() VAL [__return_main=0, main__i=0, main__max={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 40 mSDtfsCounter, 29 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=19occurred 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, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 16:20:42,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd --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 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:20:45,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:20:46,053 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 16:20:46,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:20:46,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:20:46,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:20:46,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:20:46,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:20:46,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:20:46,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:20:46,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:20:46,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:20:46,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:20:46,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:20:46,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:20:46,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:20:46,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:20:46,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:20:46,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:20:46,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:20:46,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:20:46,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:20:46,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:20:46,140 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:20:46,140 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:20:46,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:20:46,140 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:20:46,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:20:46,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:20:46,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:20:46,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:20:46,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:20:46,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:20:46,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:20:46,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:20:46,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:20:46,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:20:46,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:20:46,143 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:20:46,143 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:20:46,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:20:46,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:20:46,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:20:46,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:20:46,143 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_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2024-11-13 16:20:46,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:20:46,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:20:46,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:20:46,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:20:46,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:20:46,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c Unable to find full path for "g++" [2024-11-13 16:20:49,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:20:49,324 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:20:49,329 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2024-11-13 16:20:49,342 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/data/b26e0ba4f/3b674676616148a0a203a760e47a5553/FLAG782d01bb0 [2024-11-13 16:20:49,375 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/data/b26e0ba4f/3b674676616148a0a203a760e47a5553 [2024-11-13 16:20:49,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:20:49,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:20:49,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:20:49,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:20:49,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:20:49,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dccaecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49, skipping insertion in model container [2024-11-13 16:20:49,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:20:49,652 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_709a8c0c-231a-4738-8f78-40f775c1d3fd/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2024-11-13 16:20:49,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:20:49,677 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:20:49,713 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_709a8c0c-231a-4738-8f78-40f775c1d3fd/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2024-11-13 16:20:49,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:20:49,738 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:20:49,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49 WrapperNode [2024-11-13 16:20:49,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:20:49,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:20:49,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:20:49,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:20:49,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,778 INFO L138 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 102 [2024-11-13 16:20:49,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:20:49,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:20:49,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:20:49,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:20:49,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,806 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-13 16:20:49,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:20:49,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:20:49,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:20:49,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:20:49,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (1/1) ... [2024-11-13 16:20:49,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:20:49,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:49,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:49,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:20:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:20:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 16:20:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 16:20:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 16:20:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:20:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 16:20:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 16:20:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:20:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 16:20:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 16:20:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 16:20:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:20:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:20:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:20:49,991 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:20:49,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:20:51,807 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-13 16:20:51,807 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:20:51,817 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:20:51,817 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 16:20:51,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:20:51 BoogieIcfgContainer [2024-11-13 16:20:51,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:20:51,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:20:51,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:20:51,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:20:51,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:20:49" (1/3) ... [2024-11-13 16:20:51,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb9f0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:20:51, skipping insertion in model container [2024-11-13 16:20:51,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:20:49" (2/3) ... [2024-11-13 16:20:51,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb9f0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:20:51, skipping insertion in model container [2024-11-13 16:20:51,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:20:51" (3/3) ... [2024-11-13 16:20:51,831 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2024-11-13 16:20:51,850 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:20:51,853 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c.p+cfa-reducer.c that has 1 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 16:20:51,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:20:51,914 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;@5ae5a918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:20:51,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:20:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-13 16:20:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 16:20:51,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:51,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:20:51,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:51,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2024-11-13 16:20:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116561] [2024-11-13 16:20:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:51,955 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-13 16:20:51,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:51,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:51,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:52,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:20:52,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:52,519 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-13 16:20:52,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:20:52,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:20:52,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116561] [2024-11-13 16:20:52,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:20:52,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:20:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:20:52,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219573431] [2024-11-13 16:20:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:52,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:20:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:20:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:20:52,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:20:52,551 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) 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-13 16:20:55,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:55,739 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2024-11-13 16:20:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:20:55,742 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-13 16:20:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:55,751 INFO L225 Difference]: With dead ends: 33 [2024-11-13 16:20:55,751 INFO L226 Difference]: Without dead ends: 19 [2024-11-13 16:20:55,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:20:55,758 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 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.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:55,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 16:20:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-13 16:20:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-13 16:20:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 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-13 16:20:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-13 16:20:55,794 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2024-11-13 16:20:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:55,795 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-13 16:20:55,795 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-13 16:20:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-11-13 16:20:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:20:55,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:55,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:20:55,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:55,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:55,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:55,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2024-11-13 16:20:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531486397] [2024-11-13 16:20:55,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:55,999 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-13 16:20:55,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:56,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:56,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:56,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:20:56,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:56,544 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-13 16:20:56,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:20:56,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:20:56,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531486397] [2024-11-13 16:20:56,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531486397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:20:56,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:20:56,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:20:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430379256] [2024-11-13 16:20:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:20:56,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:20:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:20:56,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:20:56,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:20:56,552 INFO L87 Difference]: Start difference. First operand 17 states and 22 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-13 16:20:58,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:20:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:20:58,787 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-11-13 16:20:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:20:58,790 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-13 16:20:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:20:58,791 INFO L225 Difference]: With dead ends: 21 [2024-11-13 16:20:58,791 INFO L226 Difference]: Without dead ends: 17 [2024-11-13 16:20:58,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:20:58,792 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:20:58,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 16:20:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-13 16:20:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-13 16:20:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-13 16:20:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-13 16:20:58,799 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2024-11-13 16:20:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:20:58,800 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-13 16:20:58,800 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-13 16:20:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-13 16:20:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:20:58,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:20:58,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:20:58,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:59,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:59,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:20:59,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2024-11-13 16:20:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:20:59,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440043139] [2024-11-13 16:20:59,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:59,006 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-13 16:20:59,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:20:59,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:59,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:20:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:59,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 16:20:59,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:01,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:21:01,628 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-13 16:21:01,655 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-13 16:21:33,838 WARN L286 SmtUtils]: Spent 12.08s 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-13 16:21:45,995 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:21:55,374 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:22:00,459 WARN L286 SmtUtils]: Spent 5.08s 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-13 16:22:09,207 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0)))) is different from false [2024-11-13 16:22:13,222 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0)))) is different from true [2024-11-13 16:22:25,371 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:22:30,808 WARN L286 SmtUtils]: Spent 5.44s 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-13 16:22:38,912 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-13 16:22:44,538 WARN L286 SmtUtils]: Spent 5.62s 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-13 16:22:56,671 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-13 16:23:02,722 WARN L286 SmtUtils]: Spent 6.05s 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-13 16:23:10,837 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:23,377 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-13 16:23:23,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:23:23,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:23:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440043139] [2024-11-13 16:23:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440043139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:23:23,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:23:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 16:23:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256448390] [2024-11-13 16:23:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:23:23,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:23:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:23:23,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:23:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=61, Unknown=2, NotChecked=16, Total=110 [2024-11-13 16:23:23,380 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:23:26,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:27,810 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-13 16:23:31,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:33,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:35,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:36,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:38,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:41,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:23:45,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:49,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:53,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:23:57,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:01,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:05,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:09,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:13,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:17,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:21,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:25,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:29,493 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 16:24:32,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:38,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:24:42,729 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-13 16:24:46,735 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-13 16:24:50,741 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-13 16:24:54,745 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-13 16:24:58,754 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-13 16:25:02,760 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-13 16:25:06,765 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-13 16:25:08,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:25:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:08,568 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-13 16:25:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:25:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 16:25:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:08,577 INFO L225 Difference]: With dead ends: 31 [2024-11-13 16:25:08,577 INFO L226 Difference]: Without dead ends: 26 [2024-11-13 16:25:08,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=33, Invalid=62, Unknown=3, NotChecked=34, Total=132 [2024-11-13 16:25:08,579 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 101.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:08,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 36 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 18 Unknown, 50 Unchecked, 101.1s Time] [2024-11-13 16:25:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-13 16:25:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-11-13 16:25:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-13 16:25:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-13 16:25:08,584 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2024-11-13 16:25:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:08,584 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-13 16:25:08,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:25:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-11-13 16:25:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:25:08,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:08,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:08,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:25:08,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:25:08,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:08,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2024-11-13 16:25:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:25:08,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449043132] [2024-11-13 16:25:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:08,790 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-13 16:25:08,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:25:08,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:25:08,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:25:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:09,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:25:09,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:09,184 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-13 16:25:09,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:25:09,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:25:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449043132] [2024-11-13 16:25:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449043132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:09,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:09,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968542260] [2024-11-13 16:25:09,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:09,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:25:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:25:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:09,186 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-13 16:25:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:09,212 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-11-13 16:25:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-13 16:25:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:25:09,213 INFO L225 Difference]: With dead ends: 32 [2024-11-13 16:25:09,213 INFO L226 Difference]: Without dead ends: 19 [2024-11-13 16:25:09,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-13 16:25:09,215 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:25:09,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:25:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-13 16:25:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-13 16:25:09,218 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-13 16:25:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-13 16:25:09,219 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2024-11-13 16:25:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:25:09,219 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-13 16:25:09,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-13 16:25:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-13 16:25:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 16:25:09,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:25:09,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:25:09,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:25:09,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:25:09,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:25:09,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2024-11-13 16:25:09,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:25:09,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424569287] [2024-11-13 16:25:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:09,426 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-13 16:25:09,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:25:09,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:25:09,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:25:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:10,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 16:25:10,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:25:12,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:25:12,695 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-13 16:25:12,723 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-13 16:25:53,148 WARN L286 SmtUtils]: Spent 13.23s 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-13 16:26:00,629 WARN L286 SmtUtils]: Spent 7.47s 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-13 16:26:07,513 WARN L286 SmtUtils]: Spent 6.88s 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-13 16:27:19,346 WARN L286 SmtUtils]: Spent 38.15s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:27:31,712 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:27:39,849 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-13 16:27:57,183 WARN L286 SmtUtils]: Spent 8.10s 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-13 16:28:01,217 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-13 16:28:05,234 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-13 16:28:17,384 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-13 16:28:24,847 WARN L286 SmtUtils]: Spent 7.46s 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-13 16:28:30,401 WARN L286 SmtUtils]: Spent 5.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-13 16:28:43,022 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-13 16:28:55,166 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-13 16:29:02,711 WARN L286 SmtUtils]: Spent 7.54s 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-13 16:29:08,414 WARN L286 SmtUtils]: Spent 5.70s 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-13 16:29:13,606 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:29:17,581 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-13 16:29:17,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:29:17,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:29:17,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424569287] [2024-11-13 16:29:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424569287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:29:17,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:29:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:29:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360009480] [2024-11-13 16:29:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:29:17,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 16:29:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:29:17,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 16:29:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=6, NotChecked=18, Total=132 [2024-11-13 16:29:17,582 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) 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-13 16:29:19,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:22,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:25,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:27,005 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-13 16:29:28,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:32,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:34,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:29:38,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:41,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:29:43,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:29:45,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:49,561 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-13 16:29:53,713 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-13 16:29:57,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:59,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:29:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:29:59,115 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-13 16:29:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:29:59,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) 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-13 16:29:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:29:59,121 INFO L225 Difference]: With dead ends: 25 [2024-11-13 16:29:59,121 INFO L226 Difference]: Without dead ends: 17 [2024-11-13 16:29:59,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 110.3s TimeCoverageRelationStatistics Valid=36, Invalid=75, Unknown=7, NotChecked=38, Total=156 [2024-11-13 16:29:59,122 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 37.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:29:59,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 35 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 2 Unknown, 42 Unchecked, 37.4s Time] [2024-11-13 16:29:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-13 16:29:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-13 16:29:59,126 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-13 16:29:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-13 16:29:59,126 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2024-11-13 16:29:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:29:59,126 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-13 16:29:59,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) 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-13 16:29:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-13 16:29:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 16:29:59,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:29:59,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:29:59,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:29:59,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:29:59,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:29:59,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:29:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1048715671, now seen corresponding path program 1 times [2024-11-13 16:29:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:29:59,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478834172] [2024-11-13 16:29:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:29:59,330 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-13 16:29:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:29:59,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:29:59,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:29:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:29:59,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 16:29:59,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:29:59,781 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-13 16:29:59,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:29:59,893 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-13 16:29:59,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:29:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478834172] [2024-11-13 16:29:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478834172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:29:59,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:29:59,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-13 16:29:59,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603277701] [2024-11-13 16:29:59,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:29:59,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:29:59,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:29:59,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:29:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:29:59,895 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-13 16:30:01,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 16:30:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:30:01,194 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-13 16:30:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:30:01,195 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-13 16:30:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:30:01,196 INFO L225 Difference]: With dead ends: 33 [2024-11-13 16:30:01,197 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 16:30:01,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:30:01,197 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:30:01,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 37 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 16:30:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 16:30:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-13 16:30:01,201 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-13 16:30:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-13 16:30:01,201 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2024-11-13 16:30:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:30:01,201 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-13 16:30:01,202 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-13 16:30:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-13 16:30:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 16:30:01,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:30:01,202 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:30:01,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 16:30:01,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:30:01,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:30:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:30:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash -673335440, now seen corresponding path program 1 times [2024-11-13 16:30:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:30:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332839286] [2024-11-13 16:30:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:30:01,404 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-13 16:30:01,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:30:01,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:30:01,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709a8c0c-231a-4738-8f78-40f775c1d3fd/bin/uautomizer-verify-qhAvR1uOyd/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-13 16:30:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:30:01,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 16:30:01,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:30:04,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:30:04,866 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-13 16:30:04,903 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-13 16:30:36,694 WARN L286 SmtUtils]: Spent 11.72s 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-13 16:30:39,313 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-13 16:30:39,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:30:50,067 WARN L286 SmtUtils]: Spent 6.37s 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-13 16:32:32,659 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:32:40,308 WARN L286 SmtUtils]: Spent 7.65s 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-13 16:32:47,406 WARN L286 SmtUtils]: Spent 7.10s 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-13 16:32:51,440 WARN L851 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from false [2024-11-13 16:33:03,169 WARN L286 SmtUtils]: Spent 8.14s 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-13 16:33:08,900 WARN L286 SmtUtils]: Spent 5.73s 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-13 16:33:12,930 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-13 16:33:16,960 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-13 16:33:31,458 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-13 16:33:35,488 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-13 16:33:43,020 WARN L286 SmtUtils]: Spent 7.53s 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-13 16:33:50,790 WARN L286 SmtUtils]: Spent 7.77s 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-13 16:33:56,403 WARN L286 SmtUtils]: Spent 5.61s 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-13 16:34:00,435 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-13 16:34:11,528 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-13 16:34:19,113 WARN L286 SmtUtils]: Spent 7.58s 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-13 16:34:27,180 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-13 16:35:52,247 WARN L286 SmtUtils]: Spent 20.31s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:35:58,208 WARN L286 SmtUtils]: Spent 5.96s 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)