/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 13:41:40,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 13:41:40,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 13:41:40,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 13:41:40,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 13:41:40,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 13:41:40,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 13:41:40,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 13:41:40,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 13:41:40,762 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 13:41:40,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 13:41:40,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 13:41:40,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 13:41:40,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 13:41:40,765 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 13:41:40,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 13:41:40,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 13:41:40,766 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 13:41:40,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 13:41:40,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 13:41:40,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 13:41:40,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 13:41:40,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 13:41:40,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 13:41:40,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 13:41:40,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 13:41:40,768 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 13:41:40,768 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 13:41:40,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 13:41:40,768 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 13:41:40,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 13:41:40,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 13:41:40,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 13:41:40,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 13:41:40,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:41:40,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 13:41:40,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 13:41:40,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 13:41:40,770 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 13:41:40,771 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 13:41:40,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 13:41:40,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 13:41:40,771 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 13:41:40,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 13:41:40,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 13:41:40,772 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 13:41:40,772 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 13:41:40,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 13:41:40,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 13:41:40,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 13:41:41,000 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 13:41:41,000 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 13:41:41,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-12-24 13:41:42,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 13:41:42,213 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 13:41:42,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-12-24 13:41:42,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cbe30f23/3a6dcb0c201547629547c8ec6af03ba1/FLAGc1a97dbff [2023-12-24 13:41:42,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cbe30f23/3a6dcb0c201547629547c8ec6af03ba1 [2023-12-24 13:41:42,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 13:41:42,241 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 13:41:42,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 13:41:42,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 13:41:42,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 13:41:42,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108b72e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42, skipping insertion in model container [2023-12-24 13:41:42,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,264 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 13:41:42,359 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-12-24 13:41:42,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:41:42,425 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 13:41:42,436 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-12-24 13:41:42,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:41:42,506 INFO L206 MainTranslator]: Completed translation [2023-12-24 13:41:42,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42 WrapperNode [2023-12-24 13:41:42,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 13:41:42,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 13:41:42,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 13:41:42,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 13:41:42,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,584 INFO L138 Inliner]: procedures = 36, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2023-12-24 13:41:42,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 13:41:42,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 13:41:42,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 13:41:42,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 13:41:42,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,617 INFO L175 MemorySlicer]: Split 147 memory accesses to 7 slices as follows [2, 35, 5, 27, 3, 72, 3]. 49 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 4, 1, 2, 1, 11, 1]. The 23 writes are split as follows [0, 6, 1, 2, 1, 12, 1]. [2023-12-24 13:41:42,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 13:41:42,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 13:41:42,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 13:41:42,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 13:41:42,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (1/1) ... [2023-12-24 13:41:42,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:41:42,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 13:41:42,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 13:41:42,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 13:41:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 13:41:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 13:41:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 13:41:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-24 13:41:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-24 13:41:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 13:41:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 13:41:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-24 13:41:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 13:41:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2023-12-24 13:41:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 13:41:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 13:41:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 13:41:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 13:41:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 13:41:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 13:41:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-12-24 13:41:42,900 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 13:41:42,902 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 13:41:43,756 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 13:41:43,818 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 13:41:43,819 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 13:41:43,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:41:43 BoogieIcfgContainer [2023-12-24 13:41:43,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 13:41:43,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 13:41:43,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 13:41:43,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 13:41:43,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:41:42" (1/3) ... [2023-12-24 13:41:43,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493330a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:41:43, skipping insertion in model container [2023-12-24 13:41:43,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:41:42" (2/3) ... [2023-12-24 13:41:43,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493330a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:41:43, skipping insertion in model container [2023-12-24 13:41:43,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:41:43" (3/3) ... [2023-12-24 13:41:43,827 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-61.i [2023-12-24 13:41:43,841 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 13:41:43,841 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 13:41:43,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 13:41:43,885 INFO L357 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, mHoare=true, 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;@4330a9f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 13:41:43,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 13:41:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 13:41:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-24 13:41:43,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:43,900 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:43,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:43,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2119270199, now seen corresponding path program 1 times [2023-12-24 13:41:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:43,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93620509] [2023-12-24 13:41:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:43,919 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 [2023-12-24 13:41:43,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:43,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:43,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:44,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 13:41:44,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2023-12-24 13:41:44,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:41:44,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93620509] [2023-12-24 13:41:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93620509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:41:44,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:41:44,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 13:41:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632820184] [2023-12-24 13:41:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:44,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 13:41:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 13:41:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:41:44,344 INFO L87 Difference]: Start difference. First operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:41:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:44,397 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2023-12-24 13:41:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 13:41:44,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-12-24 13:41:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:44,407 INFO L225 Difference]: With dead ends: 223 [2023-12-24 13:41:44,408 INFO L226 Difference]: Without dead ends: 111 [2023-12-24 13:41:44,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:41:44,418 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:44,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:41:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-24 13:41:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-24 13:41:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 13:41:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-12-24 13:41:44,472 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2023-12-24 13:41:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:44,473 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-12-24 13:41:44,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:41:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-12-24 13:41:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-24 13:41:44,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:44,476 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:44,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 13:41:44,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:44,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:44,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1896348451, now seen corresponding path program 1 times [2023-12-24 13:41:44,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:44,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118630007] [2023-12-24 13:41:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:44,685 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 [2023-12-24 13:41:44,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:44,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:44,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:44,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:41:44,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:41:45,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:41:45,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118630007] [2023-12-24 13:41:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118630007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:41:45,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:41:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:41:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689690564] [2023-12-24 13:41:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:45,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:41:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:41:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:41:45,077 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:45,314 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2023-12-24 13:41:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:41:45,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-24 13:41:45,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:45,318 INFO L225 Difference]: With dead ends: 269 [2023-12-24 13:41:45,318 INFO L226 Difference]: Without dead ends: 159 [2023-12-24 13:41:45,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:41:45,320 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 66 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:45,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 551 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:41:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-24 13:41:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2023-12-24 13:41:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 13:41:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2023-12-24 13:41:45,329 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 185 [2023-12-24 13:41:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:45,330 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2023-12-24 13:41:45,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2023-12-24 13:41:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-24 13:41:45,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:45,336 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:45,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 13:41:45,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:45,544 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:45,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1889145755, now seen corresponding path program 1 times [2023-12-24 13:41:45,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:45,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193708015] [2023-12-24 13:41:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:45,545 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 [2023-12-24 13:41:45,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:45,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:45,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:45,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:41:45,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:41:45,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:41:45,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:45,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193708015] [2023-12-24 13:41:45,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193708015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:41:45,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:41:45,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:41:45,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656923566] [2023-12-24 13:41:45,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:45,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:41:45,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:45,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:41:45,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:41:45,808 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:45,904 INFO L93 Difference]: Finished difference Result 257 states and 375 transitions. [2023-12-24 13:41:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:41:45,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-24 13:41:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:45,906 INFO L225 Difference]: With dead ends: 257 [2023-12-24 13:41:45,906 INFO L226 Difference]: Without dead ends: 145 [2023-12-24 13:41:45,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:41:45,907 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 83 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:45,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 756 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:41:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-24 13:41:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2023-12-24 13:41:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 13:41:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2023-12-24 13:41:45,923 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 185 [2023-12-24 13:41:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:45,924 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2023-12-24 13:41:45,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2023-12-24 13:41:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-24 13:41:45,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:45,926 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:45,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 13:41:46,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:46,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:46,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1079799129, now seen corresponding path program 1 times [2023-12-24 13:41:46,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:46,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058660028] [2023-12-24 13:41:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:46,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:41:46,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:46,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:46,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:46,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:41:46,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:41:46,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:41:46,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:46,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058660028] [2023-12-24 13:41:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058660028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:41:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:41:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 13:41:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670593992] [2023-12-24 13:41:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:46,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:41:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:46,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:41:46,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:41:46,429 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:46,631 INFO L93 Difference]: Finished difference Result 267 states and 380 transitions. [2023-12-24 13:41:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 13:41:46,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-24 13:41:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:46,633 INFO L225 Difference]: With dead ends: 267 [2023-12-24 13:41:46,633 INFO L226 Difference]: Without dead ends: 149 [2023-12-24 13:41:46,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2023-12-24 13:41:46,634 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 72 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:46,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1033 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:41:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-24 13:41:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2023-12-24 13:41:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-24 13:41:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2023-12-24 13:41:46,641 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 185 [2023-12-24 13:41:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:46,641 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2023-12-24 13:41:46,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2023-12-24 13:41:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-24 13:41:46,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:46,643 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:46,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:46,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:46,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:46,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1079858711, now seen corresponding path program 1 times [2023-12-24 13:41:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92131124] [2023-12-24 13:41:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:46,851 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 [2023-12-24 13:41:46,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:46,865 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:46,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:47,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:41:47,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:48,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 61 [2023-12-24 13:41:48,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 13:41:48,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-12-24 13:41:48,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:41:48,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2023-12-24 13:41:48,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:41:48,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 49 [2023-12-24 13:41:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:41:49,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:41:49,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:49,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92131124] [2023-12-24 13:41:49,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92131124] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:41:49,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:41:49,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 13:41:49,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848204223] [2023-12-24 13:41:49,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:49,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:41:49,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:49,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:41:49,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:41:49,082 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:41:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:51,425 INFO L93 Difference]: Finished difference Result 372 states and 527 transitions. [2023-12-24 13:41:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:41:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2023-12-24 13:41:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:51,427 INFO L225 Difference]: With dead ends: 372 [2023-12-24 13:41:51,427 INFO L226 Difference]: Without dead ends: 250 [2023-12-24 13:41:51,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:41:51,428 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 256 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:51,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 831 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-24 13:41:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-12-24 13:41:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2023-12-24 13:41:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 189 states have (on average 1.291005291005291) internal successors, (244), 190 states have internal predecessors, (244), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:41:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 344 transitions. [2023-12-24 13:41:51,444 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 344 transitions. Word has length 185 [2023-12-24 13:41:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:51,444 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 344 transitions. [2023-12-24 13:41:51,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:41:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 344 transitions. [2023-12-24 13:41:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-24 13:41:51,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:51,446 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:51,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 13:41:51,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:51,655 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:51,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 262210261, now seen corresponding path program 1 times [2023-12-24 13:41:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:51,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670304331] [2023-12-24 13:41:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:51,656 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 [2023-12-24 13:41:51,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:51,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:51,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:51,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:41:51,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:51,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 43 treesize of output 19 [2023-12-24 13:41:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:41:51,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:41:51,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670304331] [2023-12-24 13:41:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670304331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:41:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:41:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:41:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258020903] [2023-12-24 13:41:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:51,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 13:41:51,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:51,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 13:41:51,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:41:51,918 INFO L87 Difference]: Start difference. First operand 243 states and 344 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:52,220 INFO L93 Difference]: Finished difference Result 485 states and 687 transitions. [2023-12-24 13:41:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 13:41:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-12-24 13:41:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:52,231 INFO L225 Difference]: With dead ends: 485 [2023-12-24 13:41:52,231 INFO L226 Difference]: Without dead ends: 243 [2023-12-24 13:41:52,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:41:52,233 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:52,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 310 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:41:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-24 13:41:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-12-24 13:41:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 190 states have internal predecessors, (242), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:41:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 342 transitions. [2023-12-24 13:41:52,257 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 342 transitions. Word has length 185 [2023-12-24 13:41:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:52,258 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 342 transitions. [2023-12-24 13:41:52,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 342 transitions. [2023-12-24 13:41:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-24 13:41:52,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:52,260 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:52,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:52,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:52,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:52,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash 684912087, now seen corresponding path program 1 times [2023-12-24 13:41:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:52,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798833372] [2023-12-24 13:41:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:52,471 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 [2023-12-24 13:41:52,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:52,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:52,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:52,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:41:52,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:52,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:41:52,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 18 [2023-12-24 13:41:52,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 18 [2023-12-24 13:41:53,370 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 27 treesize of output 15 [2023-12-24 13:41:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 50 proven. 138 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-24 13:41:53,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:41:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2023-12-24 13:41:53,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:53,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798833372] [2023-12-24 13:41:53,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798833372] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:41:53,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:41:53,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-12-24 13:41:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070047252] [2023-12-24 13:41:53,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:41:53,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 13:41:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:53,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 13:41:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:41:53,718 INFO L87 Difference]: Start difference. First operand 243 states and 342 transitions. Second operand has 16 states, 12 states have (on average 8.75) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) [2023-12-24 13:41:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:54,198 INFO L93 Difference]: Finished difference Result 504 states and 698 transitions. [2023-12-24 13:41:54,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 13:41:54,198 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 8.75) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) Word has length 185 [2023-12-24 13:41:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:54,200 INFO L225 Difference]: With dead ends: 504 [2023-12-24 13:41:54,200 INFO L226 Difference]: Without dead ends: 262 [2023-12-24 13:41:54,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:41:54,201 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 234 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:54,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 645 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:41:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-24 13:41:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 255. [2023-12-24 13:41:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 197 states have (on average 1.2588832487309645) internal successors, (248), 198 states have internal predecessors, (248), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:41:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 348 transitions. [2023-12-24 13:41:54,230 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 348 transitions. Word has length 185 [2023-12-24 13:41:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:54,230 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 348 transitions. [2023-12-24 13:41:54,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 8.75) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) [2023-12-24 13:41:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2023-12-24 13:41:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-24 13:41:54,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:54,232 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:54,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-12-24 13:41:54,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:54,439 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:54,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1507419554, now seen corresponding path program 1 times [2023-12-24 13:41:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563081877] [2023-12-24 13:41:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:54,440 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 [2023-12-24 13:41:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:54,441 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (9)] Waiting until timeout for monitored process [2023-12-24 13:41:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:54,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:41:54,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:54,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 13:41:54,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 25 [2023-12-24 13:41:55,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:41:55,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2023-12-24 13:41:55,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:41:55,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 39 [2023-12-24 13:41:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2023-12-24 13:41:55,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:41:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:41:55,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563081877] [2023-12-24 13:41:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563081877] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:41:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:41:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2023-12-24 13:41:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69136147] [2023-12-24 13:41:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:55,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:41:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:41:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:41:55,985 INFO L87 Difference]: Start difference. First operand 255 states and 348 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:56,245 INFO L93 Difference]: Finished difference Result 697 states and 943 transitions. [2023-12-24 13:41:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:41:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2023-12-24 13:41:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:56,248 INFO L225 Difference]: With dead ends: 697 [2023-12-24 13:41:56,248 INFO L226 Difference]: Without dead ends: 443 [2023-12-24 13:41:56,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-12-24 13:41:56,249 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 171 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:56,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 723 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:41:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-12-24 13:41:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 273. [2023-12-24 13:41:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 215 states have (on average 1.2604651162790699) internal successors, (271), 216 states have internal predecessors, (271), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:41:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 371 transitions. [2023-12-24 13:41:56,263 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 371 transitions. Word has length 187 [2023-12-24 13:41:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:56,263 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 371 transitions. [2023-12-24 13:41:56,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 371 transitions. [2023-12-24 13:41:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-24 13:41:56,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:56,265 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:56,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (9)] Forceful destruction successful, exit code 0 [2023-12-24 13:41:56,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:56,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:56,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1199199840, now seen corresponding path program 1 times [2023-12-24 13:41:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:56,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873730812] [2023-12-24 13:41:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:56,473 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 [2023-12-24 13:41:56,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:56,475 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:56,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (10)] Waiting until timeout for monitored process [2023-12-24 13:41:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:56,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 13:41:56,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:57,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 61 [2023-12-24 13:41:57,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:41:57,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 58 [2023-12-24 13:41:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:41:57,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:41:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:41:57,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:57,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873730812] [2023-12-24 13:41:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873730812] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:41:57,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:41:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-12-24 13:41:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700382874] [2023-12-24 13:41:57,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:57,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:41:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:57,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:41:57,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:41:57,913 INFO L87 Difference]: Start difference. First operand 273 states and 371 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:58,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:58,340 INFO L93 Difference]: Finished difference Result 911 states and 1239 transitions. [2023-12-24 13:41:58,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:41:58,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2023-12-24 13:41:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:58,343 INFO L225 Difference]: With dead ends: 911 [2023-12-24 13:41:58,343 INFO L226 Difference]: Without dead ends: 639 [2023-12-24 13:41:58,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:41:58,345 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 360 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:58,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 443 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:41:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-12-24 13:41:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 273. [2023-12-24 13:41:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 215 states have (on average 1.2511627906976743) internal successors, (269), 216 states have internal predecessors, (269), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:41:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 369 transitions. [2023-12-24 13:41:58,362 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 369 transitions. Word has length 187 [2023-12-24 13:41:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:58,362 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 369 transitions. [2023-12-24 13:41:58,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 369 transitions. [2023-12-24 13:41:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-24 13:41:58,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:58,363 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:58,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (10)] Forceful destruction successful, exit code 0 [2023-12-24 13:41:58,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:58,570 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:58,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -118748057, now seen corresponding path program 1 times [2023-12-24 13:41:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:58,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439714673] [2023-12-24 13:41:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:58,571 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 [2023-12-24 13:41:58,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:58,573 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:58,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (11)] Waiting until timeout for monitored process [2023-12-24 13:41:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:58,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:41:58,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:41:58,808 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 43 treesize of output 19 [2023-12-24 13:41:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:41:58,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:41:58,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:41:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439714673] [2023-12-24 13:41:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439714673] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:41:58,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:41:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:41:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297611657] [2023-12-24 13:41:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:41:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 13:41:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:41:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 13:41:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:41:58,822 INFO L87 Difference]: Start difference. First operand 273 states and 369 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:41:58,855 INFO L93 Difference]: Finished difference Result 541 states and 731 transitions. [2023-12-24 13:41:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 13:41:58,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2023-12-24 13:41:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:41:58,857 INFO L225 Difference]: With dead ends: 541 [2023-12-24 13:41:58,857 INFO L226 Difference]: Without dead ends: 269 [2023-12-24 13:41:58,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:41:58,858 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 41 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:41:58,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:41:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-24 13:41:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2023-12-24 13:41:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 211 states have (on average 1.2274881516587677) internal successors, (259), 212 states have internal predecessors, (259), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:41:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 359 transitions. [2023-12-24 13:41:58,870 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 359 transitions. Word has length 187 [2023-12-24 13:41:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:41:58,870 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 359 transitions. [2023-12-24 13:41:58,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:41:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 359 transitions. [2023-12-24 13:41:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-24 13:41:58,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:41:58,871 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:41:58,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (11)] Forceful destruction successful, exit code 0 [2023-12-24 13:41:59,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:41:59,078 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:41:59,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:41:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash 982109408, now seen corresponding path program 1 times [2023-12-24 13:41:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:41:59,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810870982] [2023-12-24 13:41:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:41:59,079 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 [2023-12-24 13:41:59,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:41:59,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:41:59,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (12)] Waiting until timeout for monitored process [2023-12-24 13:41:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:41:59,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:41:59,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:00,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 61 [2023-12-24 13:42:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:42:00,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:42:00,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810870982] [2023-12-24 13:42:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810870982] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:00,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:00,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2023-12-24 13:42:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410209469] [2023-12-24 13:42:00,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:00,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:00,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:00,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:00,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:42:00,579 INFO L87 Difference]: Start difference. First operand 269 states and 359 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:02,614 INFO L93 Difference]: Finished difference Result 779 states and 1042 transitions. [2023-12-24 13:42:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:02,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 187 [2023-12-24 13:42:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:02,618 INFO L225 Difference]: With dead ends: 779 [2023-12-24 13:42:02,618 INFO L226 Difference]: Without dead ends: 511 [2023-12-24 13:42:02,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:42:02,619 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 273 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:02,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 643 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 13:42:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-24 13:42:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 281. [2023-12-24 13:42:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 223 states have (on average 1.2197309417040358) internal successors, (272), 224 states have internal predecessors, (272), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:42:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2023-12-24 13:42:02,639 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 187 [2023-12-24 13:42:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:02,640 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2023-12-24 13:42:02,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2023-12-24 13:42:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-24 13:42:02,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:02,641 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:02,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (12)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:02,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:02,848 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:02,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -606238494, now seen corresponding path program 1 times [2023-12-24 13:42:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:02,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687093987] [2023-12-24 13:42:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:02,849 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 [2023-12-24 13:42:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:02,850 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:02,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (13)] Waiting until timeout for monitored process [2023-12-24 13:42:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:03,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:42:03,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:03,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 61 [2023-12-24 13:42:03,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:03,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 58 [2023-12-24 13:42:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:42:03,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:04,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687093987] [2023-12-24 13:42:04,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687093987] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1629612786] [2023-12-24 13:42:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:04,037 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:42:04,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:42:04,081 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:42:04,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-24 13:42:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:04,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:42:04,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:05,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 61 [2023-12-24 13:42:05,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:05,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 58 [2023-12-24 13:42:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:42:05,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:05,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1629612786] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:05,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:42:05,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-12-24 13:42:05,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624056225] [2023-12-24 13:42:05,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:42:05,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:42:05,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:42:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:42:05,888 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:42:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:07,650 INFO L93 Difference]: Finished difference Result 562 states and 745 transitions. [2023-12-24 13:42:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:42:07,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2023-12-24 13:42:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:07,653 INFO L225 Difference]: With dead ends: 562 [2023-12-24 13:42:07,653 INFO L226 Difference]: Without dead ends: 282 [2023-12-24 13:42:07,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-24 13:42:07,654 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 400 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:07,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 919 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-24 13:42:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-24 13:42:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2023-12-24 13:42:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 218 states have internal predecessors, (264), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:42:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 364 transitions. [2023-12-24 13:42:07,668 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 364 transitions. Word has length 187 [2023-12-24 13:42:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:07,669 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 364 transitions. [2023-12-24 13:42:07,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:42:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 364 transitions. [2023-12-24 13:42:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-24 13:42:07,670 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:07,670 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:07,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:07,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (13)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:08,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:08,085 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:08,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash 597272358, now seen corresponding path program 1 times [2023-12-24 13:42:08,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:08,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185962397] [2023-12-24 13:42:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:08,086 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 [2023-12-24 13:42:08,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:08,088 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:08,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (15)] Waiting until timeout for monitored process [2023-12-24 13:42:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:08,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:42:08,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:42:08,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:08,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:08,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185962397] [2023-12-24 13:42:08,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185962397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:08,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:08,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:42:08,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425683144] [2023-12-24 13:42:08,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:08,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:42:08,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:08,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:42:08,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:42:08,349 INFO L87 Difference]: Start difference. First operand 275 states and 364 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:42:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:08,402 INFO L93 Difference]: Finished difference Result 553 states and 733 transitions. [2023-12-24 13:42:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:42:08,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2023-12-24 13:42:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:08,405 INFO L225 Difference]: With dead ends: 553 [2023-12-24 13:42:08,405 INFO L226 Difference]: Without dead ends: 279 [2023-12-24 13:42:08,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:42:08,406 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 7 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:08,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 456 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:42:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-12-24 13:42:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2023-12-24 13:42:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 217 states have (on average 1.2119815668202765) internal successors, (263), 218 states have internal predecessors, (263), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-24 13:42:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 363 transitions. [2023-12-24 13:42:08,418 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 363 transitions. Word has length 187 [2023-12-24 13:42:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:08,418 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 363 transitions. [2023-12-24 13:42:08,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:42:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 363 transitions. [2023-12-24 13:42:08,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-24 13:42:08,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:08,420 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:08,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (15)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:08,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:08,626 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:08,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1101229323, now seen corresponding path program 1 times [2023-12-24 13:42:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:08,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772302955] [2023-12-24 13:42:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:08,628 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 [2023-12-24 13:42:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:08,629 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:08,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (16)] Waiting until timeout for monitored process [2023-12-24 13:42:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:08,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:42:08,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:09,142 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 39 treesize of output 21 [2023-12-24 13:42:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 414 proven. 57 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2023-12-24 13:42:09,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-12-24 13:42:09,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772302955] [2023-12-24 13:42:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772302955] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:42:09,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:42:09,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-24 13:42:09,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129518614] [2023-12-24 13:42:09,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:42:09,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:42:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:09,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:42:09,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:09,389 INFO L87 Difference]: Start difference. First operand 275 states and 363 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2023-12-24 13:42:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:09,810 INFO L93 Difference]: Finished difference Result 567 states and 741 transitions. [2023-12-24 13:42:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:42:09,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) Word has length 188 [2023-12-24 13:42:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:09,812 INFO L225 Difference]: With dead ends: 567 [2023-12-24 13:42:09,812 INFO L226 Difference]: Without dead ends: 293 [2023-12-24 13:42:09,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:42:09,813 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 267 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:09,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 459 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:42:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-12-24 13:42:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 275. [2023-12-24 13:42:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 218 states have (on average 1.201834862385321) internal successors, (262), 219 states have internal predecessors, (262), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:42:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 358 transitions. [2023-12-24 13:42:09,832 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 358 transitions. Word has length 188 [2023-12-24 13:42:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:09,832 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 358 transitions. [2023-12-24 13:42:09,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2023-12-24 13:42:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 358 transitions. [2023-12-24 13:42:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-24 13:42:09,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:09,834 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:09,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (16)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:10,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:10,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:10,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash 967215817, now seen corresponding path program 1 times [2023-12-24 13:42:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:10,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977462012] [2023-12-24 13:42:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:10,041 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 [2023-12-24 13:42:10,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:10,042 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:10,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (17)] Waiting until timeout for monitored process [2023-12-24 13:42:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:10,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:42:10,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:10,281 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 43 treesize of output 19 [2023-12-24 13:42:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:42:10,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:10,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977462012] [2023-12-24 13:42:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977462012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:10,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:10,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:42:10,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72800429] [2023-12-24 13:42:10,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:10,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 13:42:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 13:42:10,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:42:10,294 INFO L87 Difference]: Start difference. First operand 275 states and 358 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:10,337 INFO L93 Difference]: Finished difference Result 528 states and 691 transitions. [2023-12-24 13:42:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 13:42:10,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 188 [2023-12-24 13:42:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:10,338 INFO L225 Difference]: With dead ends: 528 [2023-12-24 13:42:10,338 INFO L226 Difference]: Without dead ends: 254 [2023-12-24 13:42:10,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:42:10,339 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:10,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:42:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-24 13:42:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2023-12-24 13:42:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 197 states have (on average 1.1979695431472082) internal successors, (236), 198 states have internal predecessors, (236), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:42:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 332 transitions. [2023-12-24 13:42:10,353 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 332 transitions. Word has length 188 [2023-12-24 13:42:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:10,353 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 332 transitions. [2023-12-24 13:42:10,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 332 transitions. [2023-12-24 13:42:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-24 13:42:10,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:10,354 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:10,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (17)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:10,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:10,561 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:10,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1054288682, now seen corresponding path program 1 times [2023-12-24 13:42:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020429120] [2023-12-24 13:42:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:10,562 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 [2023-12-24 13:42:10,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:10,563 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:10,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (18)] Waiting until timeout for monitored process [2023-12-24 13:42:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:10,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 13:42:10,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:10,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 13:42:11,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-12-24 13:42:11,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:11,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2023-12-24 13:42:11,164 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 62 treesize of output 26 [2023-12-24 13:42:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:42:11,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:11,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020429120] [2023-12-24 13:42:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020429120] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:11,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:11,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:42:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25578312] [2023-12-24 13:42:11,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:11,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:42:11,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:11,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:42:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:42:11,215 INFO L87 Difference]: Start difference. First operand 254 states and 332 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:13,958 INFO L93 Difference]: Finished difference Result 806 states and 1070 transitions. [2023-12-24 13:42:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:42:13,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 189 [2023-12-24 13:42:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:13,961 INFO L225 Difference]: With dead ends: 806 [2023-12-24 13:42:13,961 INFO L226 Difference]: Without dead ends: 553 [2023-12-24 13:42:13,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:13,962 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 349 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:13,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1096 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-24 13:42:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2023-12-24 13:42:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 254. [2023-12-24 13:42:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 197 states have (on average 1.1928934010152283) internal successors, (235), 198 states have internal predecessors, (235), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:42:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 331 transitions. [2023-12-24 13:42:13,983 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 331 transitions. Word has length 189 [2023-12-24 13:42:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:13,983 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 331 transitions. [2023-12-24 13:42:13,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 331 transitions. [2023-12-24 13:42:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-24 13:42:13,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:13,984 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:13,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (18)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:14,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:14,191 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:14,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash 236640232, now seen corresponding path program 1 times [2023-12-24 13:42:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:14,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639132903] [2023-12-24 13:42:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:14,192 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 [2023-12-24 13:42:14,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:14,193 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:14,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (19)] Waiting until timeout for monitored process [2023-12-24 13:42:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:14,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:42:14,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:15,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 119 treesize of output 59 [2023-12-24 13:42:15,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:15,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 56 [2023-12-24 13:42:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 510 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-12-24 13:42:15,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:15,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639132903] [2023-12-24 13:42:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639132903] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [807771144] [2023-12-24 13:42:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:15,476 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:42:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:42:15,480 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:42:15,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-12-24 13:42:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:16,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 13:42:16,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:17,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 119 treesize of output 59 [2023-12-24 13:42:17,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:17,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 56 [2023-12-24 13:42:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 510 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-12-24 13:42:17,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [807771144] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:17,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:42:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2023-12-24 13:42:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690016788] [2023-12-24 13:42:17,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:42:17,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 13:42:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 13:42:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:42:17,456 INFO L87 Difference]: Start difference. First operand 254 states and 331 transitions. Second operand has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 13:42:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:19,988 INFO L93 Difference]: Finished difference Result 643 states and 833 transitions. [2023-12-24 13:42:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 13:42:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 189 [2023-12-24 13:42:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:19,990 INFO L225 Difference]: With dead ends: 643 [2023-12-24 13:42:19,990 INFO L226 Difference]: Without dead ends: 390 [2023-12-24 13:42:19,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 427 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=834, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 13:42:19,991 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 316 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:19,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 917 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-24 13:42:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-24 13:42:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 314. [2023-12-24 13:42:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 236 states have (on average 1.1779661016949152) internal successors, (278), 237 states have internal predecessors, (278), 67 states have call successors, (67), 10 states have call predecessors, (67), 10 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2023-12-24 13:42:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 412 transitions. [2023-12-24 13:42:20,045 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 412 transitions. Word has length 189 [2023-12-24 13:42:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:20,045 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 412 transitions. [2023-12-24 13:42:20,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 13:42:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 412 transitions. [2023-12-24 13:42:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-24 13:42:20,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:20,047 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:20,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:20,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (19)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:20,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:20,471 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:20,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash -28007258, now seen corresponding path program 1 times [2023-12-24 13:42:20,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:20,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172856167] [2023-12-24 13:42:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:20,472 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 [2023-12-24 13:42:20,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:20,474 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:20,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (21)] Waiting until timeout for monitored process [2023-12-24 13:42:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:20,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:42:20,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2023-12-24 13:42:20,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:20,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:20,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172856167] [2023-12-24 13:42:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172856167] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:20,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:42:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742280193] [2023-12-24 13:42:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:20,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:42:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:20,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:42:20,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:42:20,756 INFO L87 Difference]: Start difference. First operand 314 states and 412 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 13:42:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:20,960 INFO L93 Difference]: Finished difference Result 519 states and 676 transitions. [2023-12-24 13:42:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:42:20,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 189 [2023-12-24 13:42:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:20,975 INFO L225 Difference]: With dead ends: 519 [2023-12-24 13:42:20,975 INFO L226 Difference]: Without dead ends: 200 [2023-12-24 13:42:20,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:42:20,976 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:20,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 537 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-24 13:42:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2023-12-24 13:42:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.1571428571428573) internal successors, (162), 140 states have internal predecessors, (162), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:42:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 250 transitions. [2023-12-24 13:42:20,994 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 250 transitions. Word has length 189 [2023-12-24 13:42:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:20,994 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 250 transitions. [2023-12-24 13:42:20,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 13:42:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 250 transitions. [2023-12-24 13:42:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-24 13:42:20,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:20,995 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:21,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (21)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:21,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:21,202 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:21,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1481143, now seen corresponding path program 1 times [2023-12-24 13:42:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732902832] [2023-12-24 13:42:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:21,203 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 [2023-12-24 13:42:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:21,218 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:21,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (22)] Waiting until timeout for monitored process [2023-12-24 13:42:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:21,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:42:21,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:22,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 13:42:22,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-12-24 13:42:22,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 61 [2023-12-24 13:42:23,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:23,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 24 [2023-12-24 13:42:23,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:23,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 49 [2023-12-24 13:42:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:42:23,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:23,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:23,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732902832] [2023-12-24 13:42:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732902832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:23,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 13:42:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339727253] [2023-12-24 13:42:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:23,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:42:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:23,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:42:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:42:23,486 INFO L87 Difference]: Start difference. First operand 192 states and 250 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:42:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:26,256 INFO L93 Difference]: Finished difference Result 457 states and 588 transitions. [2023-12-24 13:42:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:42:26,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-12-24 13:42:26,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:26,258 INFO L225 Difference]: With dead ends: 457 [2023-12-24 13:42:26,258 INFO L226 Difference]: Without dead ends: 266 [2023-12-24 13:42:26,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:42:26,259 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 268 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:26,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1114 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-24 13:42:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-12-24 13:42:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 200. [2023-12-24 13:42:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 148 states have internal predecessors, (171), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:42:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 259 transitions. [2023-12-24 13:42:26,277 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 259 transitions. Word has length 190 [2023-12-24 13:42:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:26,277 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 259 transitions. [2023-12-24 13:42:26,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 13:42:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 259 transitions. [2023-12-24 13:42:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-24 13:42:26,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:26,278 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:26,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (22)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:26,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:26,485 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:26,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:26,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1281344821, now seen corresponding path program 1 times [2023-12-24 13:42:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610993271] [2023-12-24 13:42:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:26,486 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 [2023-12-24 13:42:26,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:26,500 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:26,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (23)] Waiting until timeout for monitored process [2023-12-24 13:42:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:26,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:42:26,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:42:26,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:26,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610993271] [2023-12-24 13:42:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610993271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:42:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376071843] [2023-12-24 13:42:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:26,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:42:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:26,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:42:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:42:26,767 INFO L87 Difference]: Start difference. First operand 200 states and 259 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:26,903 INFO L93 Difference]: Finished difference Result 426 states and 554 transitions. [2023-12-24 13:42:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:42:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-12-24 13:42:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:26,905 INFO L225 Difference]: With dead ends: 426 [2023-12-24 13:42:26,905 INFO L226 Difference]: Without dead ends: 227 [2023-12-24 13:42:26,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:42:26,906 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 66 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:26,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 601 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:42:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-24 13:42:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2023-12-24 13:42:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.1523178807947019) internal successors, (174), 151 states have internal predecessors, (174), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:42:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 262 transitions. [2023-12-24 13:42:26,924 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 262 transitions. Word has length 190 [2023-12-24 13:42:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:26,924 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 262 transitions. [2023-12-24 13:42:26,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 262 transitions. [2023-12-24 13:42:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-24 13:42:26,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:26,925 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:26,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (23)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:27,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:27,132 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:27,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash -290644679, now seen corresponding path program 1 times [2023-12-24 13:42:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881242067] [2023-12-24 13:42:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:27,133 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 [2023-12-24 13:42:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:27,134 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:27,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (24)] Waiting until timeout for monitored process [2023-12-24 13:42:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:27,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:42:27,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:27,421 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 43 treesize of output 19 [2023-12-24 13:42:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:42:27,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:27,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881242067] [2023-12-24 13:42:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881242067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:42:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456259788] [2023-12-24 13:42:27,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:27,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 13:42:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 13:42:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:42:27,433 INFO L87 Difference]: Start difference. First operand 203 states and 262 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:27,473 INFO L93 Difference]: Finished difference Result 405 states and 523 transitions. [2023-12-24 13:42:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 13:42:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2023-12-24 13:42:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:27,475 INFO L225 Difference]: With dead ends: 405 [2023-12-24 13:42:27,475 INFO L226 Difference]: Without dead ends: 203 [2023-12-24 13:42:27,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 13:42:27,476 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 33 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:27,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 252 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:42:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-24 13:42:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2023-12-24 13:42:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.1390728476821192) internal successors, (172), 151 states have internal predecessors, (172), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:42:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2023-12-24 13:42:27,493 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 260 transitions. Word has length 192 [2023-12-24 13:42:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:27,493 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 260 transitions. [2023-12-24 13:42:27,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:42:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 260 transitions. [2023-12-24 13:42:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-24 13:42:27,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:27,494 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:27,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (24)] Ended with exit code 0 [2023-12-24 13:42:27,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:27,701 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:27,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2010177911, now seen corresponding path program 1 times [2023-12-24 13:42:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:27,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505331724] [2023-12-24 13:42:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:27,702 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 [2023-12-24 13:42:27,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:27,703 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:27,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (25)] Waiting until timeout for monitored process [2023-12-24 13:42:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:28,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:42:28,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:28,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:42:28,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 18 [2023-12-24 13:42:28,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 18 [2023-12-24 13:42:28,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 18 [2023-12-24 13:42:28,731 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 27 treesize of output 15 [2023-12-24 13:42:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 50 proven. 138 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-24 13:42:28,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2023-12-24 13:42:29,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:29,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505331724] [2023-12-24 13:42:29,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505331724] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:42:29,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:42:29,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-12-24 13:42:29,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635161474] [2023-12-24 13:42:29,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:42:29,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 13:42:29,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:29,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 13:42:29,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:42:29,031 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand has 16 states, 12 states have (on average 11.333333333333334) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) [2023-12-24 13:42:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:29,578 INFO L93 Difference]: Finished difference Result 421 states and 535 transitions. [2023-12-24 13:42:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 13:42:29,579 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 11.333333333333334) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) Word has length 192 [2023-12-24 13:42:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:29,580 INFO L225 Difference]: With dead ends: 421 [2023-12-24 13:42:29,580 INFO L226 Difference]: Without dead ends: 219 [2023-12-24 13:42:29,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:42:29,585 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 71 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:29,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 810 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:42:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-24 13:42:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2023-12-24 13:42:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.1324503311258278) internal successors, (171), 151 states have internal predecessors, (171), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 13:42:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 259 transitions. [2023-12-24 13:42:29,603 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 259 transitions. Word has length 192 [2023-12-24 13:42:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:29,603 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 259 transitions. [2023-12-24 13:42:29,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 11.333333333333334) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 6 states have call successors, (50) [2023-12-24 13:42:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 259 transitions. [2023-12-24 13:42:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-24 13:42:29,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:29,604 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:29,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (25)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:29,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:29,811 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:29,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1690764609, now seen corresponding path program 1 times [2023-12-24 13:42:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912622206] [2023-12-24 13:42:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:29,812 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 [2023-12-24 13:42:29,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:29,813 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:29,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (26)] Waiting until timeout for monitored process [2023-12-24 13:42:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:30,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 13:42:30,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:30,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:42:30,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:42:30,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 14 [2023-12-24 13:42:30,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 24 [2023-12-24 13:42:30,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:30,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2023-12-24 13:42:30,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:30,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2023-12-24 13:42:30,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:30,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2023-12-24 13:42:30,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:30,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2023-12-24 13:42:31,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:31,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 97 [2023-12-24 13:42:31,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:31,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 154 treesize of output 76 [2023-12-24 13:42:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-12-24 13:42:31,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:42:31,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912622206] [2023-12-24 13:42:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912622206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:42:31,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:42:31,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 13:42:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818910177] [2023-12-24 13:42:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:31,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 13:42:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:31,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 13:42:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:42:31,327 INFO L87 Difference]: Start difference. First operand 203 states and 259 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-24 13:42:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:42:33,415 INFO L93 Difference]: Finished difference Result 539 states and 680 transitions. [2023-12-24 13:42:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:42:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 192 [2023-12-24 13:42:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:42:33,417 INFO L225 Difference]: With dead ends: 539 [2023-12-24 13:42:33,417 INFO L226 Difference]: Without dead ends: 337 [2023-12-24 13:42:33,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2023-12-24 13:42:33,418 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 528 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:42:33,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 692 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-24 13:42:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-12-24 13:42:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 306. [2023-12-24 13:42:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 231 states have (on average 1.1385281385281385) internal successors, (263), 233 states have internal predecessors, (263), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:42:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 383 transitions. [2023-12-24 13:42:33,477 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 383 transitions. Word has length 192 [2023-12-24 13:42:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:42:33,477 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 383 transitions. [2023-12-24 13:42:33,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 5 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-24 13:42:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 383 transitions. [2023-12-24 13:42:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-24 13:42:33,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:42:33,478 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:42:33,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (26)] Forceful destruction successful, exit code 0 [2023-12-24 13:42:33,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:42:33,686 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:42:33,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:42:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash 798764353, now seen corresponding path program 1 times [2023-12-24 13:42:33,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:42:33,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896748702] [2023-12-24 13:42:33,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:42:33,687 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 [2023-12-24 13:42:33,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:42:33,688 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:42:33,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (27)] Waiting until timeout for monitored process [2023-12-24 13:42:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:42:33,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 13:42:33,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:42:35,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2023-12-24 13:42:35,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 119 treesize of output 59 [2023-12-24 13:42:40,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:40,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 56 [2023-12-24 13:42:41,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:42:41,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 63 [2023-12-24 13:42:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 474 proven. 54 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-12-24 13:42:43,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:42:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:42:56,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:42:56,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896748702] [2023-12-24 13:42:56,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896748702] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:42:56,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:42:56,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2023-12-24 13:42:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325048738] [2023-12-24 13:42:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:42:56,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:42:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:42:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:42:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-12-24 13:42:56,492 INFO L87 Difference]: Start difference. First operand 306 states and 383 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:21,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:43:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:43:32,133 INFO L93 Difference]: Finished difference Result 775 states and 980 transitions. [2023-12-24 13:43:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:43:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2023-12-24 13:43:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:43:32,148 INFO L225 Difference]: With dead ends: 775 [2023-12-24 13:43:32,148 INFO L226 Difference]: Without dead ends: 470 [2023-12-24 13:43:32,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:43:32,149 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 352 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:43:32,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 961 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 30.7s Time] [2023-12-24 13:43:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-12-24 13:43:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 293. [2023-12-24 13:43:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 218 states have (on average 1.1376146788990826) internal successors, (248), 220 states have internal predecessors, (248), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:43:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2023-12-24 13:43:32,197 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 192 [2023-12-24 13:43:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:43:32,197 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2023-12-24 13:43:32,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2023-12-24 13:43:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-24 13:43:32,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:43:32,198 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:43:32,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (27)] Ended with exit code 0 [2023-12-24 13:43:32,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:43:32,404 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:43:32,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:43:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1921010834, now seen corresponding path program 1 times [2023-12-24 13:43:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:43:32,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872003272] [2023-12-24 13:43:32,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:43:32,405 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 [2023-12-24 13:43:32,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:43:32,406 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:43:32,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (28)] Waiting until timeout for monitored process [2023-12-24 13:43:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:43:32,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-24 13:43:32,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:43:32,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-24 13:43:32,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-12-24 13:43:33,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:33,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-12-24 13:43:33,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:33,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-12-24 13:43:33,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:33,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2023-12-24 13:43:33,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:33,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 62 [2023-12-24 13:43:33,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:33,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 75 [2023-12-24 13:43:34,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:34,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 88 [2023-12-24 13:43:35,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:35,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 84 treesize of output 101 [2023-12-24 13:43:35,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:35,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 121 [2023-12-24 13:43:37,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:37,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 136 treesize of output 58 [2023-12-24 13:43:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 975 proven. 75 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-24 13:43:37,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:43:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:43:38,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:43:38,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872003272] [2023-12-24 13:43:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872003272] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:43:38,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:43:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [25] total 31 [2023-12-24 13:43:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89979757] [2023-12-24 13:43:38,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:43:38,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:43:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:43:38,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:43:38,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2023-12-24 13:43:38,041 INFO L87 Difference]: Start difference. First operand 293 states and 368 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:43:39,137 INFO L93 Difference]: Finished difference Result 819 states and 1014 transitions. [2023-12-24 13:43:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 13:43:39,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 194 [2023-12-24 13:43:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:43:39,139 INFO L225 Difference]: With dead ends: 819 [2023-12-24 13:43:39,139 INFO L226 Difference]: Without dead ends: 527 [2023-12-24 13:43:39,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2023-12-24 13:43:39,140 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 211 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:43:39,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1274 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 13:43:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-12-24 13:43:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 471. [2023-12-24 13:43:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 372 states have (on average 1.1559139784946237) internal successors, (430), 376 states have internal predecessors, (430), 74 states have call successors, (74), 24 states have call predecessors, (74), 24 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-24 13:43:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 578 transitions. [2023-12-24 13:43:39,205 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 578 transitions. Word has length 194 [2023-12-24 13:43:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:43:39,206 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 578 transitions. [2023-12-24 13:43:39,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 578 transitions. [2023-12-24 13:43:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-24 13:43:39,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:43:39,207 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:43:39,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (28)] Forceful destruction successful, exit code 0 [2023-12-24 13:43:39,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:43:39,414 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:43:39,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:43:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash 909893584, now seen corresponding path program 1 times [2023-12-24 13:43:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:43:39,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654450597] [2023-12-24 13:43:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:43:39,415 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 [2023-12-24 13:43:39,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:43:39,416 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:43:39,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (29)] Waiting until timeout for monitored process [2023-12-24 13:43:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:43:39,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 13:43:39,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:43:39,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:43:39,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 13 [2023-12-24 13:43:40,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:40,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2023-12-24 13:43:40,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:40,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2023-12-24 13:43:40,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:40,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2023-12-24 13:43:40,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:40,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2023-12-24 13:43:40,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:40,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2023-12-24 13:43:40,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:40,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2023-12-24 13:43:40,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:40,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2023-12-24 13:43:40,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:40,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 56 [2023-12-24 13:43:41,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:41,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 33 [2023-12-24 13:43:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 628 proven. 87 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2023-12-24 13:43:41,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:43:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:43:41,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:43:41,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654450597] [2023-12-24 13:43:41,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654450597] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:43:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:43:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2023-12-24 13:43:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429229505] [2023-12-24 13:43:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:43:41,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:43:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:43:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:43:41,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-24 13:43:41,597 INFO L87 Difference]: Start difference. First operand 471 states and 578 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:43:42,073 INFO L93 Difference]: Finished difference Result 997 states and 1222 transitions. [2023-12-24 13:43:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:43:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 194 [2023-12-24 13:43:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:43:42,076 INFO L225 Difference]: With dead ends: 997 [2023-12-24 13:43:42,076 INFO L226 Difference]: Without dead ends: 527 [2023-12-24 13:43:42,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:43:42,077 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 149 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:43:42,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 446 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:43:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-12-24 13:43:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 459. [2023-12-24 13:43:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 360 states have (on average 1.15) internal successors, (414), 364 states have internal predecessors, (414), 74 states have call successors, (74), 24 states have call predecessors, (74), 24 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-24 13:43:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 562 transitions. [2023-12-24 13:43:42,194 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 562 transitions. Word has length 194 [2023-12-24 13:43:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:43:42,194 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 562 transitions. [2023-12-24 13:43:42,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 562 transitions. [2023-12-24 13:43:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-24 13:43:42,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:43:42,195 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:43:42,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (29)] Forceful destruction successful, exit code 0 [2023-12-24 13:43:42,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:43:42,402 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:43:42,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:43:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash 891651536, now seen corresponding path program 1 times [2023-12-24 13:43:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:43:42,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241825840] [2023-12-24 13:43:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:43:42,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 [2023-12-24 13:43:42,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:43:42,404 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:43:42,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (30)] Waiting until timeout for monitored process [2023-12-24 13:43:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:43:42,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 13:43:42,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:43:42,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-24 13:43:42,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2023-12-24 13:43:43,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:43,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 35 [2023-12-24 13:43:43,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:43,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2023-12-24 13:43:43,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:43,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 48 [2023-12-24 13:43:43,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:43,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 58 [2023-12-24 13:43:43,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:43,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 66 [2023-12-24 13:43:44,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:44,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 79 [2023-12-24 13:43:44,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:44,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 87 [2023-12-24 13:43:45,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:45,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 105 treesize of output 112 [2023-12-24 13:43:46,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:46,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 114 treesize of output 54 [2023-12-24 13:43:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 983 proven. 87 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-12-24 13:43:46,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:43:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:43:46,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:43:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241825840] [2023-12-24 13:43:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241825840] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:43:46,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:43:46,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 24 [2023-12-24 13:43:46,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678813668] [2023-12-24 13:43:46,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:43:46,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:43:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:43:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:43:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:43:46,486 INFO L87 Difference]: Start difference. First operand 459 states and 562 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:43:46,893 INFO L93 Difference]: Finished difference Result 949 states and 1152 transitions. [2023-12-24 13:43:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:43:46,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 194 [2023-12-24 13:43:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:43:46,904 INFO L225 Difference]: With dead ends: 949 [2023-12-24 13:43:46,904 INFO L226 Difference]: Without dead ends: 491 [2023-12-24 13:43:46,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2023-12-24 13:43:46,905 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 136 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:43:46,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 433 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:43:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-24 13:43:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 357. [2023-12-24 13:43:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 280 states have (on average 1.1214285714285714) internal successors, (314), 282 states have internal predecessors, (314), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 13:43:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 434 transitions. [2023-12-24 13:43:46,951 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 434 transitions. Word has length 194 [2023-12-24 13:43:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:43:46,952 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 434 transitions. [2023-12-24 13:43:46,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 434 transitions. [2023-12-24 13:43:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-24 13:43:46,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:43:46,953 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:43:46,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (30)] Forceful destruction successful, exit code 0 [2023-12-24 13:43:47,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:43:47,160 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:43:47,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:43:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash -119465714, now seen corresponding path program 1 times [2023-12-24 13:43:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:43:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183797667] [2023-12-24 13:43:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:43:47,161 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 [2023-12-24 13:43:47,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:43:47,162 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:43:47,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (31)] Waiting until timeout for monitored process [2023-12-24 13:43:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:43:47,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 13:43:47,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:43:47,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:43:47,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:43:47,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:43:47,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 24 [2023-12-24 13:43:47,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:47,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2023-12-24 13:43:47,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:47,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2023-12-24 13:43:47,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:47,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2023-12-24 13:43:48,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:48,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2023-12-24 13:43:48,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:48,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 53 [2023-12-24 13:43:48,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:48,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 33 [2023-12-24 13:43:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 13:43:48,595 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:43:48,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:43:48,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183797667] [2023-12-24 13:43:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183797667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:43:48,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:43:48,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-24 13:43:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024523486] [2023-12-24 13:43:48,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:43:48,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 13:43:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:43:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 13:43:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:43:48,597 INFO L87 Difference]: Start difference. First operand 357 states and 434 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 13:43:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:43:50,963 INFO L93 Difference]: Finished difference Result 875 states and 1054 transitions. [2023-12-24 13:43:50,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 13:43:50,964 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 194 [2023-12-24 13:43:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:43:50,966 INFO L225 Difference]: With dead ends: 875 [2023-12-24 13:43:50,966 INFO L226 Difference]: Without dead ends: 519 [2023-12-24 13:43:50,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:43:50,967 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 239 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:43:50,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1111 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-24 13:43:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-12-24 13:43:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 513. [2023-12-24 13:43:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 396 states have (on average 1.1262626262626263) internal successors, (446), 402 states have internal predecessors, (446), 84 states have call successors, (84), 32 states have call predecessors, (84), 32 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-24 13:43:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 614 transitions. [2023-12-24 13:43:51,044 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 614 transitions. Word has length 194 [2023-12-24 13:43:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:43:51,045 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 614 transitions. [2023-12-24 13:43:51,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-12-24 13:43:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 614 transitions. [2023-12-24 13:43:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-12-24 13:43:51,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:43:51,046 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:43:51,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (31)] Forceful destruction successful, exit code 0 [2023-12-24 13:43:51,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:43:51,253 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:43:51,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:43:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 19329183, now seen corresponding path program 1 times [2023-12-24 13:43:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:43:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723365783] [2023-12-24 13:43:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:43:51,255 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 [2023-12-24 13:43:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:43:51,261 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:43:51,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (32)] Waiting until timeout for monitored process [2023-12-24 13:43:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:43:51,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 13:43:51,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:43:51,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 13:43:51,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2023-12-24 13:43:52,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2023-12-24 13:43:52,337 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 39 treesize of output 21 [2023-12-24 13:43:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2023-12-24 13:43:52,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:43:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-12-24 13:43:52,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:43:52,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723365783] [2023-12-24 13:43:52,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723365783] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:43:52,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:43:52,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-24 13:43:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631311050] [2023-12-24 13:43:52,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:43:52,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:43:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:43:52,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:43:52,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:43:52,689 INFO L87 Difference]: Start difference. First operand 513 states and 614 transitions. Second operand has 10 states, 8 states have (on average 10.625) internal successors, (85), 10 states have internal predecessors, (85), 4 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 4 states have call successors, (47) [2023-12-24 13:43:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:43:53,201 INFO L93 Difference]: Finished difference Result 1105 states and 1319 transitions. [2023-12-24 13:43:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:43:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 10.625) internal successors, (85), 10 states have internal predecessors, (85), 4 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 4 states have call successors, (47) Word has length 197 [2023-12-24 13:43:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:43:53,204 INFO L225 Difference]: With dead ends: 1105 [2023-12-24 13:43:53,204 INFO L226 Difference]: Without dead ends: 593 [2023-12-24 13:43:53,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:43:53,208 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 88 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:43:53,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 463 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:43:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-12-24 13:43:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 513. [2023-12-24 13:43:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 396 states have (on average 1.1161616161616161) internal successors, (442), 402 states have internal predecessors, (442), 84 states have call successors, (84), 32 states have call predecessors, (84), 32 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-24 13:43:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 610 transitions. [2023-12-24 13:43:53,295 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 610 transitions. Word has length 197 [2023-12-24 13:43:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:43:53,295 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 610 transitions. [2023-12-24 13:43:53,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 10.625) internal successors, (85), 10 states have internal predecessors, (85), 4 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 2 states have call predecessors, (47), 4 states have call successors, (47) [2023-12-24 13:43:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 610 transitions. [2023-12-24 13:43:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 13:43:53,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:43:53,297 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:43:53,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (32)] Ended with exit code 0 [2023-12-24 13:43:53,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:43:53,504 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:43:53,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:43:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash -658945639, now seen corresponding path program 1 times [2023-12-24 13:43:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:43:53,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570783792] [2023-12-24 13:43:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:43:53,505 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 [2023-12-24 13:43:53,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:43:53,506 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:43:53,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (33)] Waiting until timeout for monitored process [2023-12-24 13:43:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:43:54,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 13:43:54,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:43:54,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:43:55,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 61 [2023-12-24 13:43:55,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:55,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 77 [2023-12-24 13:43:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:43:55,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:43:55,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:43:55,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570783792] [2023-12-24 13:43:55,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570783792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:43:55,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [668505737] [2023-12-24 13:43:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:43:55,690 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:43:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:43:55,692 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:43:55,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-24 13:43:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:43:57,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 13:43:57,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:43:57,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:43:58,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2023-12-24 13:43:58,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:43:58,949 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 173 treesize of output 77 [2023-12-24 13:43:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 456 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-12-24 13:43:58,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:43:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:43:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [668505737] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:43:59,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:43:59,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 10] total 20 [2023-12-24 13:43:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112981640] [2023-12-24 13:43:59,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:43:59,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:43:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:43:59,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:43:59,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-12-24 13:43:59,207 INFO L87 Difference]: Start difference. First operand 513 states and 610 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:43:59,544 INFO L93 Difference]: Finished difference Result 1029 states and 1223 transitions. [2023-12-24 13:43:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:43:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-12-24 13:43:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:43:59,547 INFO L225 Difference]: With dead ends: 1029 [2023-12-24 13:43:59,547 INFO L226 Difference]: Without dead ends: 517 [2023-12-24 13:43:59,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:43:59,548 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 111 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:43:59,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 525 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:43:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-12-24 13:43:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 513. [2023-12-24 13:43:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 396 states have (on average 1.106060606060606) internal successors, (438), 402 states have internal predecessors, (438), 84 states have call successors, (84), 32 states have call predecessors, (84), 32 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-24 13:43:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 606 transitions. [2023-12-24 13:43:59,637 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 606 transitions. Word has length 199 [2023-12-24 13:43:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:43:59,637 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 606 transitions. [2023-12-24 13:43:59,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:43:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 606 transitions. [2023-12-24 13:43:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 13:43:59,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:43:59,638 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:43:59,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2023-12-24 13:43:59,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (33)] Forceful destruction successful, exit code 0 [2023-12-24 13:44:00,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:44:00,055 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:44:00,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:44:00,055 INFO L85 PathProgramCache]: Analyzing trace with hash -716263523, now seen corresponding path program 1 times [2023-12-24 13:44:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:44:00,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892990682] [2023-12-24 13:44:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:44:00,056 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 [2023-12-24 13:44:00,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:44:00,057 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:44:00,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (35)] Waiting until timeout for monitored process [2023-12-24 13:44:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:44:00,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 13:44:00,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:44:00,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 13:44:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-12-24 13:44:01,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:44:01,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 50 [2023-12-24 13:44:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:44:01,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:44:01,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:44:01,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892990682] [2023-12-24 13:44:01,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892990682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:44:01,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:44:01,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:44:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065633188] [2023-12-24 13:44:01,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:44:01,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:44:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:44:01,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:44:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:44:01,236 INFO L87 Difference]: Start difference. First operand 513 states and 606 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:44:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:44:02,065 INFO L93 Difference]: Finished difference Result 683 states and 827 transitions. [2023-12-24 13:44:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:44:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-12-24 13:44:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:44:02,069 INFO L225 Difference]: With dead ends: 683 [2023-12-24 13:44:02,069 INFO L226 Difference]: Without dead ends: 681 [2023-12-24 13:44:02,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:44:02,074 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 138 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:44:02,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 686 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 13:44:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-12-24 13:44:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 521. [2023-12-24 13:44:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 404 states have (on average 1.103960396039604) internal successors, (446), 410 states have internal predecessors, (446), 84 states have call successors, (84), 32 states have call predecessors, (84), 32 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-24 13:44:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 614 transitions. [2023-12-24 13:44:02,174 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 614 transitions. Word has length 199 [2023-12-24 13:44:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:44:02,174 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 614 transitions. [2023-12-24 13:44:02,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:44:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 614 transitions. [2023-12-24 13:44:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 13:44:02,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:44:02,175 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:44:02,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (35)] Ended with exit code 0 [2023-12-24 13:44:02,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:44:02,380 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:44:02,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:44:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash -716203941, now seen corresponding path program 1 times [2023-12-24 13:44:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:44:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712927000] [2023-12-24 13:44:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:44:02,381 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 [2023-12-24 13:44:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:44:02,382 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:44:02,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (36)] Waiting until timeout for monitored process [2023-12-24 13:44:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:44:02,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:44:02,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:44:02,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-24 13:44:02,824 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 60 treesize of output 48 [2023-12-24 13:44:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:44:02,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:44:02,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:44:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712927000] [2023-12-24 13:44:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712927000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:44:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:44:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:44:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279117236] [2023-12-24 13:44:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:44:02,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:44:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:44:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:44:02,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:44:02,837 INFO L87 Difference]: Start difference. First operand 521 states and 614 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:44:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:44:03,407 INFO L93 Difference]: Finished difference Result 1161 states and 1381 transitions. [2023-12-24 13:44:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:44:03,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-12-24 13:44:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:44:03,410 INFO L225 Difference]: With dead ends: 1161 [2023-12-24 13:44:03,410 INFO L226 Difference]: Without dead ends: 641 [2023-12-24 13:44:03,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:44:03,412 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 90 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:44:03,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 645 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:44:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-12-24 13:44:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 639. [2023-12-24 13:44:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 474 states have (on average 1.0843881856540085) internal successors, (514), 482 states have internal predecessors, (514), 124 states have call successors, (124), 40 states have call predecessors, (124), 40 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-24 13:44:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 762 transitions. [2023-12-24 13:44:03,580 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 762 transitions. Word has length 199 [2023-12-24 13:44:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:44:03,580 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 762 transitions. [2023-12-24 13:44:03,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:44:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 762 transitions. [2023-12-24 13:44:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 13:44:03,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:44:03,581 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:44:03,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (36)] Forceful destruction successful, exit code 0 [2023-12-24 13:44:03,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:44:03,789 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:44:03,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:44:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1468292265, now seen corresponding path program 1 times [2023-12-24 13:44:03,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:44:03,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775034349] [2023-12-24 13:44:03,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:44:03,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 [2023-12-24 13:44:03,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:44:03,791 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:44:03,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (37)] Waiting until timeout for monitored process [2023-12-24 13:44:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:44:04,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:44:04,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:44:04,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-12-24 13:44:04,173 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 60 treesize of output 48 [2023-12-24 13:44:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:44:04,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:44:04,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:44:04,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775034349] [2023-12-24 13:44:04,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775034349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:44:04,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:44:04,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:44:04,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281274689] [2023-12-24 13:44:04,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:44:04,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:44:04,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:44:04,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:44:04,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:44:04,197 INFO L87 Difference]: Start difference. First operand 639 states and 762 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:44:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:44:05,059 INFO L93 Difference]: Finished difference Result 1653 states and 1935 transitions. [2023-12-24 13:44:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:44:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-12-24 13:44:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:44:05,063 INFO L225 Difference]: With dead ends: 1653 [2023-12-24 13:44:05,063 INFO L226 Difference]: Without dead ends: 1125 [2023-12-24 13:44:05,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:44:05,064 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 119 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:44:05,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 852 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:44:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2023-12-24 13:44:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1103. [2023-12-24 13:44:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 830 states have (on average 1.072289156626506) internal successors, (890), 846 states have internal predecessors, (890), 200 states have call successors, (200), 72 states have call predecessors, (200), 72 states have return successors, (200), 184 states have call predecessors, (200), 200 states have call successors, (200) [2023-12-24 13:44:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1290 transitions. [2023-12-24 13:44:05,294 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1290 transitions. Word has length 199 [2023-12-24 13:44:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:44:05,295 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1290 transitions. [2023-12-24 13:44:05,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:44:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1290 transitions. [2023-12-24 13:44:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 13:44:05,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:44:05,296 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:44:05,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (37)] Forceful destruction successful, exit code 0 [2023-12-24 13:44:05,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:44:05,500 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:44:05,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:44:05,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1797315733, now seen corresponding path program 1 times [2023-12-24 13:44:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:44:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273272848] [2023-12-24 13:44:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:44:05,501 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 [2023-12-24 13:44:05,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:44:05,503 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2023-12-24 13:44:05,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (38)] Waiting until timeout for monitored process [2023-12-24 13:44:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:44:05,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:44:05,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:44:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-12-24 13:44:05,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:44:05,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:44:05,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273272848] [2023-12-24 13:44:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273272848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:44:05,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:44:05,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:44:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771558013] [2023-12-24 13:44:05,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:44:05,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:44:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:44:05,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:44:05,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:44:05,840 INFO L87 Difference]: Start difference. First operand 1103 states and 1290 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:44:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:44:06,143 INFO L93 Difference]: Finished difference Result 1613 states and 1878 transitions. [2023-12-24 13:44:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:44:06,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 199 [2023-12-24 13:44:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:44:06,144 INFO L225 Difference]: With dead ends: 1613 [2023-12-24 13:44:06,144 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 13:44:06,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:44:06,146 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 54 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:44:06,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 553 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:44:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 13:44:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 13:44:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 13:44:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 13:44:06,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199 [2023-12-24 13:44:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:44:06,147 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 13:44:06,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-12-24 13:44:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 13:44:06,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 13:44:06,149 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 13:44:06,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (38)] Forceful destruction successful, exit code 0 [2023-12-24 13:44:06,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-24 13:44:06,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 13:44:58,803 WARN L293 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 336 DAG size of output: 152 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:46:02,885 WARN L293 SmtUtils]: Spent 32.04s on a formula simplification. DAG size of input: 914 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:46:10,433 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 13:46:10,433 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 13:46:10,433 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 13:46:10,433 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 13:46:10,434 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,434 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-24 13:46:10,434 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 13:46:10,434 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 13:46:10,434 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 13:46:10,434 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,434 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-24 13:46:10,434 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,435 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse2 (select |#memory_int#3| |~#float_Array_0~0.base|))) (let ((.cse3 (let ((.cse18 (select .cse2 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse4 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (= currentRoundingMode roundNearestTiesToEven) (fp.eq (let ((.cse1 (select .cse2 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse3) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)) (let ((.cse8 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse11 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse6 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse12 (= ((_ extract 7 0) (select .cse4 |~#BOOL_unsigned_char_Array_0~0.offset|)) |ULTIMATE.start_updateVariables_#t~mem41#1|)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse13 (let ((.cse15 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and .cse15 (exists ((|v_skolemized_q#valueAsBitvector_19| (_ BitVec 64))) (let ((.cse16 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_19|) (select .cse16 |~#double_Array_0~0.offset|)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_19|) (select .cse16 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_19|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0)))))) (fp.leq .cse3 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (fp.geq .cse3 (fp.neg .cse17))) (and .cse15 (fp.leq .cse3 .cse17) (fp.geq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) (.cse14 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse8)))) (or (and .cse5 (= ((_ zero_extend 24) ((_ extract 7 0) .cse6)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) ((_ extract 7 0) .cse8)))))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse5 .cse9 .cse10 .cse11 .cse12 (not (bvsgt .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse13 .cse14))))))) [2023-12-24 13:46:10,435 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-24 13:46:10,435 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-12-24 13:46:10,435 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,435 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 13:46:10,436 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|)) (.cse19 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse11 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse10 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse12 ((_ extract 7 0) (select .cse19 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse2 (bvsge ((_ zero_extend 24) .cse12) (_ bv1 32))) (.cse8 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse3 (let ((.cse18 (select |#memory_int#3| |~#float_Array_0~0.base|))) (let ((.cse15 (let ((.cse20 (select .cse18 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse20) ((_ extract 30 23) .cse20) ((_ extract 22 0) .cse20))))) (let ((.cse13 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse19 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse16 (= .cse15 (let ((.cse17 (select .cse18 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))))) (or (and .cse13 (exists ((|v_skolemized_q#valueAsBitvector_19| (_ BitVec 64))) (let ((.cse14 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_19|) (select .cse14 |~#double_Array_0~0.offset|)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_19|) (select .cse14 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_19|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0)))))) (fp.geq .cse15 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse16 (fp.leq .cse15 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))) (and .cse13 .cse16 (fp.leq .cse15 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (fp.geq .cse15 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse6 (= .cse12 |ULTIMATE.start_updateVariables_#t~mem42#1|)) (.cse7 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse10 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse11)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (bvsgt .cse8 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse9) (and .cse1 .cse2 (= ((_ zero_extend 24) ((_ extract 7 0) .cse10)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 ((_ zero_extend 24) ((_ extract 7 0) .cse11)))))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse19 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) [2023-12-24 13:46:10,436 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-24 13:46:10,436 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,436 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-24 13:46:10,436 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 63) no Hoare annotation was computed. [2023-12-24 13:46:10,436 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,436 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-24 13:46:10,436 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-24 13:46:10,436 INFO L899 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2023-12-24 13:46:10,437 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,437 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse18 (select |#memory_int#3| |~#float_Array_0~0.base|))) (let ((.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|)) (.cse14 (let ((.cse19 (select .cse18 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse16 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse6 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse4 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (select .cse16 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse2 (bvsge .cse12 (_ bv1 32))) (.cse3 (let ((.cse13 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse16 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)))) (or (and .cse13 (fp.leq .cse14 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (fp.geq .cse14 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (and .cse13 (fp.geq .cse14 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.leq .cse14 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (exists ((|v_skolemized_q#valueAsBitvector_53| (_ BitVec 64))) (let ((.cse15 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_53|) (select .cse15 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_53|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_53|) (select .cse15 |~#double_Array_0~0.offset|))))))))) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse8 (bvsle .cse12 (_ bv1 32))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse10 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse11 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse6)))) (or (and .cse1 .cse2 .cse3 (= ((_ zero_extend 24) ((_ extract 7 0) .cse4)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 (not (bvsgt .cse5 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse11))))) (= currentRoundingMode roundNearestTiesToEven) (fp.eq (let ((.cse17 (select .cse18 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17))) .cse14)))) [2023-12-24 13:46:10,437 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-24 13:46:10,437 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-12-24 13:46:10,437 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,437 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-24 13:46:10,438 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse18 (select |#memory_int#3| |~#float_Array_0~0.base|))) (let ((.cse1 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|)) (.cse15 (let ((.cse19 (select .cse18 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (= ((_ extract 7 0) (select .cse1 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|))) |ULTIMATE.start_updateVariables_#t~mem45#1|) (let ((.cse7 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse5 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse3 (bvsge .cse13 (_ bv1 32))) (.cse4 (let ((.cse14 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)))) (or (and .cse14 (fp.leq .cse15 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (fp.geq .cse15 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (and .cse14 (fp.geq .cse15 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.leq .cse15 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (exists ((|v_skolemized_q#valueAsBitvector_53| (_ BitVec 64))) (let ((.cse16 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_53|) (select .cse16 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_53|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_53|) (select .cse16 |~#double_Array_0~0.offset|))))))))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse9 (bvsle .cse13 (_ bv1 32))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse11 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse12 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse7)))) (or (and .cse2 .cse3 .cse4 (= ((_ zero_extend 24) ((_ extract 7 0) .cse5)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) .cse7)))))) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 (not (bvsgt .cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse12)))) (= currentRoundingMode roundNearestTiesToEven) (fp.eq (let ((.cse17 (select .cse18 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17))) .cse15)))) [2023-12-24 13:46:10,438 INFO L899 garLoopResultBuilder]: For program point L74-1(line 74) no Hoare annotation was computed. [2023-12-24 13:46:10,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 13:46:10,438 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,438 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-24 13:46:10,438 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 62) no Hoare annotation was computed. [2023-12-24 13:46:10,438 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 55 63) no Hoare annotation was computed. [2023-12-24 13:46:10,438 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 67) no Hoare annotation was computed. [2023-12-24 13:46:10,439 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|)) (.cse12 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse5 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse3 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (select .cse12 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse2 (bvsge .cse11 (_ bv1 32))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse11 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse5)))) (or (and .cse1 .cse2 (= ((_ zero_extend 24) ((_ extract 7 0) .cse3)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse5)))))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 (not (bvsgt .cse4 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse10)))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse14 (select |#memory_int#3| |~#float_Array_0~0.base|))) (fp.eq (let ((.cse13 (select .cse14 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) (let ((.cse15 (select .cse14 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse12 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) [2023-12-24 13:46:10,439 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-12-24 13:46:10,439 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-24 13:46:10,439 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 43 47) no Hoare annotation was computed. [2023-12-24 13:46:10,439 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,439 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-24 13:46:10,439 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse3 (select |#memory_int#3| |~#float_Array_0~0.base|))) (fp.eq (let ((.cse2 (select .cse3 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (select .cse3 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (let ((.cse13 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse6 (bvsge .cse15 (_ bv1 32))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse7 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse8 (bvsle .cse15 (_ bv1 32))) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse10 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse13 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse12 (= |ULTIMATE.start_updateVariables_#t~mem48#1| ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (bvsgt .cse11 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse12) (and .cse5 .cse6 (= ((_ zero_extend 24) ((_ extract 7 0) .cse13)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))) .cse7 .cse8 .cse9 .cse10 .cse12)))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32))))) [2023-12-24 13:46:10,439 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-12-24 13:46:10,439 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-12-24 13:46:10,439 INFO L899 garLoopResultBuilder]: For program point L44-2(line 44) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-3(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-5(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-7(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-8(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-9(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-10(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-12(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-14(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-16(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-17(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-18(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-19(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-21(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-23(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-25(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-26(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-27(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-29(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,440 INFO L899 garLoopResultBuilder]: For program point L111-31(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L111-32(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L79-2(line 79) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L111-34(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L79-3(line 79) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L111-36(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L79-5(line 79) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L111-37(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L79-7(line 79) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L111-39(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L895 garLoopResultBuilder]: At program point L79-8(line 79) the Hoare annotation is: (let ((.cse28 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse13 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse15 (select .cse13 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|))) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse19 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (select .cse28 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse18 (let ((.cse31 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse31) ((_ extract 30 23) .cse31) ((_ extract 22 0) .cse31)))) (.cse24 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (let ((.cse14 (fp.geq .cse18 (fp.neg .cse24))) (.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse13 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse5 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse7 (bvsge .cse29 (_ bv1 32))) (.cse20 (let ((.cse30 (fp.geq .cse18 (fp.neg .cse19)))) (or (and (not |ULTIMATE.start_updateVariables_#t~short52#1|) (not .cse30)) (and |ULTIMATE.start_updateVariables_#t~short52#1| .cse30)))) (.cse4 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse28 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse6 (fp.leq .cse18 (fp.neg .cse27))) (.cse17 (not |ULTIMATE.start_updateVariables_#t~short55#1|)) (.cse16 (not |ULTIMATE.start_updateVariables_#t~short56#1|)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse13 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse9 (bvsle .cse29 (_ bv1 32))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse13 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse11 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse15 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse2 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse28 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32))) (.cse1 (select .cse13 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|)))) (or (and .cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse1 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse2 .cse3 (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 |~#unsigned_char_Array_0~0.offset|))))) (or (and .cse4 .cse5 .cse6 .cse7 |ULTIMATE.start_updateVariables_#t~short52#1| |ULTIMATE.start_updateVariables_#t~short56#1| .cse8 .cse9 .cse10 .cse11 (not (bvsgt .cse12 ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) .cse14) (and .cse4 .cse5 .cse6 .cse7 |ULTIMATE.start_updateVariables_#t~short52#1| |ULTIMATE.start_updateVariables_#t~short56#1| (= ((_ zero_extend 24) ((_ extract 7 0) .cse15)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) .cse1)))))) .cse8 .cse9 .cse10 .cse11 .cse14)))) (and .cse4 .cse16 .cse17 (not (fp.leq .cse18 .cse19)) .cse2 (or (and .cse7 .cse9 .cse14) (and .cse7 .cse20 .cse9))) (and .cse0 .cse5 .cse7 (let ((.cse25 (fp.geq .cse18 .cse27))) (let ((.cse26 (not .cse25))) (let ((.cse21 (or (and .cse16 .cse26) (and |ULTIMATE.start_updateVariables_#t~short56#1| .cse25))) (.cse22 (or (and |ULTIMATE.start_updateVariables_#t~short55#1| .cse25) (and .cse17 .cse26))) (.cse23 (fp.leq .cse18 .cse24))) (or (and .cse4 .cse21 .cse22 .cse20 .cse23) (and .cse4 .cse21 .cse22 .cse23 (not .cse6)))))) .cse8 .cse9 .cse10 .cse11 .cse2 .cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse1))))))) [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L111-40(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L79-9(line 79) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L111-42(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,441 INFO L899 garLoopResultBuilder]: For program point L111-43(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,442 INFO L899 garLoopResultBuilder]: For program point L111-45(line 111) no Hoare annotation was computed. [2023-12-24 13:46:10,442 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,442 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-24 13:46:10,442 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,442 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-12-24 13:46:10,442 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-24 13:46:10,442 INFO L899 garLoopResultBuilder]: For program point L64-2(lines 64 66) no Hoare annotation was computed. [2023-12-24 13:46:10,442 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,442 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 13:46:10,443 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-12-24 13:46:10,443 INFO L899 garLoopResultBuilder]: For program point L48-2(line 48) no Hoare annotation was computed. [2023-12-24 13:46:10,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 13:46:10,443 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,443 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-12-24 13:46:10,443 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-12-24 13:46:10,443 INFO L899 garLoopResultBuilder]: For program point L49-2(lines 49 51) no Hoare annotation was computed. [2023-12-24 13:46:10,443 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,443 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-24 13:46:10,444 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,444 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-24 13:46:10,445 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse14 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse16 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse16 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse5 (bvsge .cse17 (_ bv1 32))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse13 (select .cse16 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse7 (bvsle .cse17 (_ bv1 32))) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse16 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse9 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= (select .cse16 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|))))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse3 (let ((.cse15 (select (select |#memory_int#3| |~#float_Array_0~0.base|) (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse11 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse14 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (fp.leq .cse3 (fp.neg .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.geq .cse3 (fp.neg .cse12)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_47|) .cse13))) (and .cse0 .cse1 .cse2 .cse5 (fp.leq .cse3 .cse12) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) .cse6 .cse7 .cse8 .cse9 .cse10 (fp.geq .cse3 .cse4) .cse11))))) [2023-12-24 13:46:10,445 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 13:46:10,445 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (let ((.cse15 (select |#memory_int#3| |~#float_Array_0~0.base|)) (.cse0 (select |#memory_int#5| |~#unsigned_char_Array_0~0.base|))) (let ((.cse8 (select .cse0 (bvadd (_ bv3 32) |~#unsigned_char_Array_0~0.offset|))) (.cse11 (let ((.cse16 (select .cse15 (bvadd |~#float_Array_0~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse13 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet69#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet69#1_53|) (select .cse0 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse7 (select .cse0 (bvadd (_ bv4 32) |~#unsigned_char_Array_0~0.offset|)))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet78#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv9 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet78#1_47|)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |~#unsigned_char_Array_0~0.offset|)))) (.cse2 (let ((.cse9 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)))) (or (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (and .cse9 (bvsge .cse10 (_ bv1 32)) (fp.geq .cse11 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.leq .cse11 (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (bvsle .cse10 (_ bv1 32)) (exists ((|v_skolemized_q#valueAsBitvector_53| (_ BitVec 64))) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_53|) (select .cse12 (bvadd |~#double_Array_0~0.offset| (_ bv4 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_53|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_53|)) ((_ to_fp 11 53) currentRoundingMode (/ 10000000000000009.0 1000000000000000000.0))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_53|) (select .cse12 |~#double_Array_0~0.offset|))))))) (and .cse9 (fp.leq .cse11 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (fp.geq .cse11 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))))) (.cse3 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet75#1_47| (_ BitVec 8))) (= (select .cse0 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet75#1_47|)))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet72#1_47| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet72#1_47|) (select .cse0 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse5 (exists ((|v_ULTIMATE.start_step_#t~mem10#1_31| (_ BitVec 8)) (|v_ULTIMATE.start_step_#t~ite9#1_32| (_ BitVec 32))) (= .cse7 ((_ sign_extend 24) ((_ extract 7 0) (bvadd |v_ULTIMATE.start_step_#t~ite9#1_32| ((_ zero_extend 24) |v_ULTIMATE.start_step_#t~mem10#1_31|)))))))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (not (bvsgt .cse6 ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))))) (and .cse1 (= ((_ zero_extend 24) ((_ extract 7 0) .cse7)) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) .cse8)))))) .cse2 .cse3 .cse4 .cse5)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_54| (_ BitVec 8))) (= .cse8 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_54|))) (= currentRoundingMode roundNearestTiesToEven) (fp.eq (let ((.cse14 (select .cse15 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) .cse11) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse13 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (_ bv0 32))))) [2023-12-24 13:46:10,445 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-12-24 13:46:10,447 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:46:10,449 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:46:10,484 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet69#1_53 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet69#1_53) == #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(6bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated [2023-12-24 13:46:10,485 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet78#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 9bv32)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet78#1_47)) could not be translated [2023-12-24 13:46:10,485 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:46:10,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] [2023-12-24 13:46:10,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] [2023-12-24 13:46:10,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_53 : bv64 :: (v_skolemized_q#valueAsBitvector_53[63:32] == #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] && ~fp~64(v_skolemized_q#valueAsBitvector_53[63:63], v_skolemized_q#valueAsBitvector_53[62:52], v_skolemized_q#valueAsBitvector_53[51:0]) == ~to_fp~64(currentRoundingMode, 10000000000000009/1000000000000000000)) && v_skolemized_q#valueAsBitvector_53[31:0] == #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset]) could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet75#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(8bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet75#1_47)) could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet72#1_47 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet72#1_47) == #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(7bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem10#1_31 : bv8, v_ULTIMATE.start_step_#t~ite9#1_32 : bv32 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(~bvadd~32(v_ULTIMATE.start_step_#t~ite9#1_32, ~zero_extend~32~16(v_ULTIMATE.start_step_#t~mem10#1_31))[7:0])) could not be translated [2023-12-24 13:46:10,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet78#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 9bv32)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet78#1_47)) could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_53 : bv64 :: (v_skolemized_q#valueAsBitvector_53[63:32] == #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] && ~fp~64(v_skolemized_q#valueAsBitvector_53[63:63], v_skolemized_q#valueAsBitvector_53[62:52], v_skolemized_q#valueAsBitvector_53[51:0]) == ~to_fp~64(currentRoundingMode, 10000000000000009/1000000000000000000)) && v_skolemized_q#valueAsBitvector_53[31:0] == #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset]) could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet75#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(8bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet75#1_47)) could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet72#1_47 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet72#1_47) == #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(7bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem10#1_31 : bv8, v_ULTIMATE.start_step_#t~ite9#1_32 : bv32 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(~bvadd~32(v_ULTIMATE.start_step_#t~ite9#1_32, ~zero_extend~32~16(v_ULTIMATE.start_step_#t~mem10#1_31))[7:0])) could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet66#1_54 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet66#1_54)) could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~#float_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~#float_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~#float_Array_0~0!offset] could not be translated [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL]]],22,0]]] [2023-12-24 13:46:10,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:46:10,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:46:10 BoogieIcfgContainer [2023-12-24 13:46:10,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:46:10,493 INFO L158 Benchmark]: Toolchain (without parser) took 268252.89ms. Allocated memory was 212.9MB in the beginning and 937.4MB in the end (delta: 724.6MB). Free memory was 165.0MB in the beginning and 849.2MB in the end (delta: -684.2MB). Peak memory consumption was 559.2MB. Max. memory is 8.0GB. [2023-12-24 13:46:10,493 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 212.9MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:46:10,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.40ms. Allocated memory is still 212.9MB. Free memory was 165.0MB in the beginning and 148.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 13:46:10,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.30ms. Allocated memory was 212.9MB in the beginning and 282.1MB in the end (delta: 69.2MB). Free memory was 148.1MB in the beginning and 252.4MB in the end (delta: -104.3MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2023-12-24 13:46:10,494 INFO L158 Benchmark]: Boogie Preprocessor took 68.42ms. Allocated memory is still 282.1MB. Free memory was 252.4MB in the beginning and 246.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-24 13:46:10,494 INFO L158 Benchmark]: RCFGBuilder took 1165.15ms. Allocated memory is still 282.1MB. Free memory was 246.1MB in the beginning and 201.5MB in the end (delta: 44.6MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2023-12-24 13:46:10,494 INFO L158 Benchmark]: TraceAbstraction took 266672.56ms. Allocated memory was 282.1MB in the beginning and 937.4MB in the end (delta: 655.4MB). Free memory was 200.5MB in the beginning and 849.2MB in the end (delta: -648.7MB). Peak memory consumption was 524.7MB. Max. memory is 8.0GB. [2023-12-24 13:46:10,494 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.13ms. Allocated memory is still 212.9MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.40ms. Allocated memory is still 212.9MB. Free memory was 165.0MB in the beginning and 148.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.30ms. Allocated memory was 212.9MB in the beginning and 282.1MB in the end (delta: 69.2MB). Free memory was 148.1MB in the beginning and 252.4MB in the end (delta: -104.3MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.42ms. Allocated memory is still 282.1MB. Free memory was 252.4MB in the beginning and 246.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1165.15ms. Allocated memory is still 282.1MB. Free memory was 246.1MB in the beginning and 201.5MB in the end (delta: 44.6MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 266672.56ms. Allocated memory was 282.1MB in the beginning and 937.4MB in the end (delta: 655.4MB). Free memory was 200.5MB in the beginning and 849.2MB in the end (delta: -648.7MB). Peak memory consumption was 524.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet69#1_53 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet69#1_53) == #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(6bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet78#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 9bv32)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet78#1_47)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_53 : bv64 :: (v_skolemized_q#valueAsBitvector_53[63:32] == #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] && ~fp~64(v_skolemized_q#valueAsBitvector_53[63:63], v_skolemized_q#valueAsBitvector_53[62:52], v_skolemized_q#valueAsBitvector_53[51:0]) == ~to_fp~64(currentRoundingMode, 10000000000000009/1000000000000000000)) && v_skolemized_q#valueAsBitvector_53[31:0] == #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet75#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(8bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet75#1_47)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet72#1_47 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet72#1_47) == #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(7bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem10#1_31 : bv8, v_ULTIMATE.start_step_#t~ite9#1_32 : bv32 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(~bvadd~32(v_ULTIMATE.start_step_#t~ite9#1_32, ~zero_extend~32~16(v_ULTIMATE.start_step_#t~mem10#1_31))[7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet78#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(~#unsigned_char_Array_0~0!offset, 9bv32)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet78#1_47)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~#unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_53 : bv64 :: (v_skolemized_q#valueAsBitvector_53[63:32] == #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] && ~fp~64(v_skolemized_q#valueAsBitvector_53[63:63], v_skolemized_q#valueAsBitvector_53[62:52], v_skolemized_q#valueAsBitvector_53[51:0]) == ~to_fp~64(currentRoundingMode, 10000000000000009/1000000000000000000)) && v_skolemized_q#valueAsBitvector_53[31:0] == #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~bvadd~32(~#float_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet75#1_47 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(8bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet75#1_47)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet72#1_47 : bv8 :: ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet72#1_47) == #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(7bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem10#1_31 : bv8, v_ULTIMATE.start_step_#t~ite9#1_32 : bv32 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(4bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(~bvadd~32(v_ULTIMATE.start_step_#t~ite9#1_32, ~zero_extend~32~16(v_ULTIMATE.start_step_#t~mem10#1_31))[7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet66#1_54 : bv8 :: #memory_int#5[~#unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#unsigned_char_Array_0~0!offset)] == ~sign_extend~32~16(v_ULTIMATE.start_updateVariables_#t~nondet66#1_54)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~#float_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~#float_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#float_Array_0~0!base][~#float_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~32,[BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL]]],31,31],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL]]],30,23],BitVectorAccessExpression[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#float_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#float_Array_0~0!offset,GLOBAL]]],22,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 266.6s, OverallIterations: 34, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 63.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 124.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5574 SdHoareTripleChecker+Valid, 53.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5555 mSDsluCounter, 22453 SdHoareTripleChecker+Invalid, 49.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16768 mSDsCounter, 700 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8102 IncrementalHoareTripleChecker+Invalid, 8802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 700 mSolverCounterUnsat, 5685 mSDtfsCounter, 8102 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9615 GetRequests, 9180 SyntacticMatches, 9 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 31.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=33, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 2136 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 1981 PreInvPairs, 2111 NumberOfFragments, 11106 HoareAnnotationTreeSize, 1981 FormulaSimplifications, 46044749 FormulaSimplificationTreeSizeReduction, 32.2s HoareSimplificationTime, 27 FormulaSimplificationsInter, 19564940 FormulaSimplificationTreeSizeReductionInter, 91.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 8.1s SatisfiabilityAnalysisTime, 55.8s InterpolantComputationTime, 7051 NumberOfCodeBlocks, 7051 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 9298 ConstructedInterpolants, 804 QuantifiedInterpolants, 154137 SizeOfPredicates, 300 NumberOfNonLiveVariables, 14579 ConjunctsInSsa, 533 ConjunctsInUnsatCore, 49 InterpolantComputations, 28 PerfectInterpolantSequences, 53886/58800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((null & 127) <= 0) && ((null & 127) >= 1)) && ((null & 127) <= 1)) || ((null & 127) <= 0)) && !(((null & 127) > (null & 127)))) || (((null & 127) == ((((null & 127) + (null & 127)) % 4294967296) & 127)) && (((((null & 127) <= 0) && ((null & 127) >= 1)) && ((null & 127) <= 1)) || ((null & 127) <= 0)))) && ((null & 127) <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-24 13:46:10,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...