/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-p_file-89.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 17:15:40,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 17:15:40,861 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 17:15:40,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 17:15:40,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 17:15:40,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 17:15:40,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 17:15:40,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 17:15:40,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 17:15:40,885 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 17:15:40,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 17:15:40,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 17:15:40,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 17:15:40,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 17:15:40,887 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 17:15:40,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 17:15:40,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 17:15:40,888 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 17:15:40,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 17:15:40,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 17:15:40,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 17:15:40,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 17:15:40,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 17:15:40,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 17:15:40,890 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 17:15:40,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 17:15:40,890 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 17:15:40,890 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 17:15:40,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 17:15:40,891 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 17:15:40,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 17:15:40,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 17:15:40,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 17:15:40,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 17:15:40,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 17:15:40,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 17:15:40,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 17:15:40,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 17:15:40,893 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 17:15:40,893 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 17:15:40,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 17:15:40,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 17:15:40,893 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 17:15:40,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 17:15:40,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 17:15:40,894 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 17:15:40,894 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 17:15:41,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 17:15:41,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 17:15:41,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 17:15:41,134 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 17:15:41,135 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 17:15:41,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2023-12-24 17:15:42,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 17:15:42,388 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 17:15:42,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2023-12-24 17:15:42,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f639bc4ca/09dfda69dd6944e083c10004c37d47aa/FLAG8e55c7695 [2023-12-24 17:15:42,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f639bc4ca/09dfda69dd6944e083c10004c37d47aa [2023-12-24 17:15:42,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 17:15:42,416 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 17:15:42,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 17:15:42,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 17:15:42,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 17:15:42,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227e93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42, skipping insertion in model container [2023-12-24 17:15:42,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,450 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 17:15:42,584 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-p_file-89.i[916,929] [2023-12-24 17:15:42,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 17:15:42,635 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 17:15:42,643 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-p_file-89.i[916,929] [2023-12-24 17:15:42,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 17:15:42,682 INFO L206 MainTranslator]: Completed translation [2023-12-24 17:15:42,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42 WrapperNode [2023-12-24 17:15:42,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 17:15:42,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 17:15:42,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 17:15:42,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 17:15:42,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,720 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2023-12-24 17:15:42,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 17:15:42,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 17:15:42,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 17:15:42,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 17:15:42,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,760 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 7, 13, 12, 6, 12, 9, 8, 12, 7, 5, 10, 4]. 12 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1]. [2023-12-24 17:15:42,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 17:15:42,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 17:15:42,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 17:15:42,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 17:15:42,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (1/1) ... [2023-12-24 17:15:42,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 17:15:42,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 17:15:42,823 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 17:15:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-24 17:15:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2023-12-24 17:15:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-24 17:15:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-24 17:15:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-24 17:15:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2023-12-24 17:15:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 17:15:42,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 17:15:42,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-24 17:15:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2023-12-24 17:15:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-24 17:15:42,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-24 17:15:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-24 17:15:42,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-24 17:15:42,825 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 17:15:43,023 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 17:15:43,025 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 17:15:43,563 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 17:15:43,616 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 17:15:43,616 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 17:15:43,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:15:43 BoogieIcfgContainer [2023-12-24 17:15:43,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 17:15:43,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 17:15:43,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 17:15:43,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 17:15:43,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 05:15:42" (1/3) ... [2023-12-24 17:15:43,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eb8a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:15:43, skipping insertion in model container [2023-12-24 17:15:43,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:15:42" (2/3) ... [2023-12-24 17:15:43,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eb8a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:15:43, skipping insertion in model container [2023-12-24 17:15:43,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:15:43" (3/3) ... [2023-12-24 17:15:43,625 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-89.i [2023-12-24 17:15:43,638 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 17:15:43,638 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 17:15:43,687 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 17:15:43,692 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;@3296e6dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 17:15:43,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 17:15:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 17:15:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:15:43,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:15:43,704 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:43,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:15:43,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:15:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2030442482, now seen corresponding path program 1 times [2023-12-24 17:15:43,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:15:43,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300921195] [2023-12-24 17:15:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:15:43,721 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 17:15:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:15:43,727 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 17:15:43,730 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 17:15:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:15:44,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 17:15:44,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:15:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-12-24 17:15:44,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:15:44,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:15:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300921195] [2023-12-24 17:15:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300921195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:15:44,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:15:44,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 17:15:44,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050928815] [2023-12-24 17:15:44,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:15:44,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 17:15:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:15:44,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 17:15:44,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 17:15:44,144 INFO L87 Difference]: Start difference. First operand has 87 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-24 17:15:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:15:44,201 INFO L93 Difference]: Finished difference Result 171 states and 269 transitions. [2023-12-24 17:15:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 17:15:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2023-12-24 17:15:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:15:44,210 INFO L225 Difference]: With dead ends: 171 [2023-12-24 17:15:44,210 INFO L226 Difference]: Without dead ends: 85 [2023-12-24 17:15:44,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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 17:15:44,217 INFO L413 NwaCegarLoop]: 120 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, 120 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 17:15:44,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:15:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-24 17:15:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-24 17:15:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 17:15:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2023-12-24 17:15:44,256 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 104 [2023-12-24 17:15:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:15:44,257 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2023-12-24 17:15:44,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-24 17:15:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2023-12-24 17:15:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:15:44,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:15:44,261 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:44,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 (2)] Ended with exit code 0 [2023-12-24 17:15:44,473 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 17:15:44,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:15:44,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:15:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1862132584, now seen corresponding path program 1 times [2023-12-24 17:15:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:15:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466468908] [2023-12-24 17:15:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:15:44,475 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 17:15:44,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:15:44,477 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 17:15:44,479 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 17:15:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:15:44,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 17:15:44,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:15:45,424 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 19 [2023-12-24 17:15:45,438 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 11 [2023-12-24 17:15:46,131 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 51 treesize of output 31 [2023-12-24 17:15:46,141 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 32 treesize of output 24 [2023-12-24 17:15:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-24 17:15:46,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:15:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:15:48,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:15:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466468908] [2023-12-24 17:15:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466468908] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:15:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:15:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-12-24 17:15:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240935396] [2023-12-24 17:15:48,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:15:48,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:15:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:15:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:15:48,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 17:15:48,329 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:15:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:15:50,831 INFO L93 Difference]: Finished difference Result 238 states and 350 transitions. [2023-12-24 17:15:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 17:15:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2023-12-24 17:15:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:15:50,840 INFO L225 Difference]: With dead ends: 238 [2023-12-24 17:15:50,840 INFO L226 Difference]: Without dead ends: 154 [2023-12-24 17:15:50,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-12-24 17:15:50,842 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 144 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:15:50,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 489 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-24 17:15:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-24 17:15:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 95. [2023-12-24 17:15:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 17:15:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2023-12-24 17:15:50,851 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 104 [2023-12-24 17:15:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:15:50,852 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2023-12-24 17:15:50,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:15:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2023-12-24 17:15:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:15:50,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:15:50,854 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:50,863 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 17:15:51,054 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 17:15:51,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:15:51,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:15:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1990296351, now seen corresponding path program 1 times [2023-12-24 17:15:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:15:51,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039595574] [2023-12-24 17:15:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:15:51,055 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 17:15:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:15:51,057 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 17:15:51,092 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 17:15:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:15:51,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 17:15:51,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:15:51,780 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 17:15:51,835 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 17 treesize of output 9 [2023-12-24 17:15:51,866 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 42 treesize of output 26 [2023-12-24 17:15:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 186 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-24 17:15:51,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:15:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:15:52,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:15:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039595574] [2023-12-24 17:15:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039595574] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:15:52,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:15:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2023-12-24 17:15:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788807915] [2023-12-24 17:15:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:15:52,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 17:15:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:15:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 17:15:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2023-12-24 17:15:52,221 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:15:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:15:52,783 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2023-12-24 17:15:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 17:15:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2023-12-24 17:15:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:15:52,784 INFO L225 Difference]: With dead ends: 274 [2023-12-24 17:15:52,785 INFO L226 Difference]: Without dead ends: 180 [2023-12-24 17:15:52,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2023-12-24 17:15:52,786 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 227 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 17:15:52,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 930 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 17:15:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-24 17:15:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 153. [2023-12-24 17:15:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 132 states have (on average 1.4166666666666667) internal successors, (187), 133 states have internal predecessors, (187), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 17:15:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2023-12-24 17:15:52,796 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 104 [2023-12-24 17:15:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:15:52,796 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2023-12-24 17:15:52,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:15:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2023-12-24 17:15:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:15:52,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:15:52,798 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:52,819 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 (4)] Ended with exit code 0 [2023-12-24 17:15:53,016 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 17:15:53,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:15:53,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:15:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1024807267, now seen corresponding path program 1 times [2023-12-24 17:15:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:15:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994543767] [2023-12-24 17:15:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:15:53,018 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 17:15:53,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:15:53,032 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 17:15:53,034 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 17:15:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:15:53,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 17:15:53,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:15:53,822 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 42 treesize of output 26 [2023-12-24 17:15:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 17 proven. 168 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-24 17:15:53,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:15:54,171 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 17:15:54,172 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 30 treesize of output 25 [2023-12-24 17:15:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-12-24 17:15:54,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:15:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994543767] [2023-12-24 17:15:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994543767] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 17:15:54,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:15:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-12-24 17:15:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305941513] [2023-12-24 17:15:54,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 17:15:54,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 17:15:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:15:54,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 17:15:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-24 17:15:54,211 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 20 states, 16 states have (on average 5.0) internal successors, (80), 18 states have internal predecessors, (80), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-24 17:15:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:15:54,928 INFO L93 Difference]: Finished difference Result 331 states and 469 transitions. [2023-12-24 17:15:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 17:15:54,928 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 5.0) internal successors, (80), 18 states have internal predecessors, (80), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) Word has length 104 [2023-12-24 17:15:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:15:54,930 INFO L225 Difference]: With dead ends: 331 [2023-12-24 17:15:54,931 INFO L226 Difference]: Without dead ends: 179 [2023-12-24 17:15:54,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2023-12-24 17:15:54,932 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 400 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 17:15:54,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 697 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 17:15:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-24 17:15:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2023-12-24 17:15:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 142 states have internal predecessors, (192), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 17:15:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 232 transitions. [2023-12-24 17:15:54,943 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 232 transitions. Word has length 104 [2023-12-24 17:15:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:15:54,943 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 232 transitions. [2023-12-24 17:15:54,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 5.0) internal successors, (80), 18 states have internal predecessors, (80), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-24 17:15:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 232 transitions. [2023-12-24 17:15:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:15:54,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:15:54,945 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:54,957 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 (5)] Forceful destruction successful, exit code 0 [2023-12-24 17:15:55,151 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 17:15:55,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:15:55,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:15:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1567594525, now seen corresponding path program 1 times [2023-12-24 17:15:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:15:55,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264668175] [2023-12-24 17:15:55,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:15:55,153 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 17:15:55,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:15:55,154 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 17:15:55,155 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 17:15:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:15:55,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 17:15:55,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:15:55,835 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 42 treesize of output 26 [2023-12-24 17:15:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 17 proven. 168 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-24 17:15:55,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:15:56,112 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 17:15:56,112 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 30 treesize of output 25 [2023-12-24 17:15:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-12-24 17:15:56,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:15:56,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264668175] [2023-12-24 17:15:56,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264668175] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 17:15:56,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:15:56,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-12-24 17:15:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169037180] [2023-12-24 17:15:56,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 17:15:56,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 17:15:56,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:15:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 17:15:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-24 17:15:56,141 INFO L87 Difference]: Start difference. First operand 166 states and 232 transitions. Second operand has 20 states, 16 states have (on average 4.625) internal successors, (74), 18 states have internal predecessors, (74), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-24 17:15:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:15:56,736 INFO L93 Difference]: Finished difference Result 321 states and 444 transitions. [2023-12-24 17:15:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 17:15:56,737 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 4.625) internal successors, (74), 18 states have internal predecessors, (74), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) Word has length 104 [2023-12-24 17:15:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:15:56,738 INFO L225 Difference]: With dead ends: 321 [2023-12-24 17:15:56,738 INFO L226 Difference]: Without dead ends: 162 [2023-12-24 17:15:56,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2023-12-24 17:15:56,739 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 268 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 17:15:56,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 700 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 17:15:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-24 17:15:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2023-12-24 17:15:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 131 states have internal predecessors, (174), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 17:15:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 214 transitions. [2023-12-24 17:15:56,748 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 214 transitions. Word has length 104 [2023-12-24 17:15:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:15:56,748 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 214 transitions. [2023-12-24 17:15:56,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 4.625) internal successors, (74), 18 states have internal predecessors, (74), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-24 17:15:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 214 transitions. [2023-12-24 17:15:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:15:56,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:15:56,760 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:56,768 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 17:15:56,966 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 17:15:56,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:15:56,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:15:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash -507062513, now seen corresponding path program 1 times [2023-12-24 17:15:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:15:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590589876] [2023-12-24 17:15:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:15:56,967 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 17:15:56,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:15:56,968 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 17:15:56,970 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 17:15:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:15:57,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 17:15:57,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:15:57,453 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 17:15:57,489 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 17 treesize of output 9 [2023-12-24 17:15:57,510 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 33 treesize of output 21 [2023-12-24 17:15:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 4 proven. 172 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-12-24 17:15:57,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:15:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:15:57,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:15:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590589876] [2023-12-24 17:15:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590589876] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:15:57,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:15:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2023-12-24 17:15:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505721914] [2023-12-24 17:15:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:15:57,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 17:15:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:15:57,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 17:15:57,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2023-12-24 17:15:57,747 INFO L87 Difference]: Start difference. First operand 155 states and 214 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:15:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:15:58,296 INFO L93 Difference]: Finished difference Result 428 states and 594 transitions. [2023-12-24 17:15:58,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 17:15:58,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2023-12-24 17:15:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:15:58,298 INFO L225 Difference]: With dead ends: 428 [2023-12-24 17:15:58,298 INFO L226 Difference]: Without dead ends: 280 [2023-12-24 17:15:58,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2023-12-24 17:15:58,299 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 264 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 17:15:58,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 879 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 17:15:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-12-24 17:15:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 221. [2023-12-24 17:15:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 187 states have (on average 1.358288770053476) internal successors, (254), 190 states have internal predecessors, (254), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-24 17:15:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2023-12-24 17:15:58,308 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 104 [2023-12-24 17:15:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:15:58,309 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2023-12-24 17:15:58,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:15:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2023-12-24 17:15:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:15:58,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:15:58,323 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:15:58,330 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 (7)] Forceful destruction successful, exit code 0 [2023-12-24 17:15:58,524 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 17:15:58,524 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:15:58,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:15:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1786926191, now seen corresponding path program 1 times [2023-12-24 17:15:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:15:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687155492] [2023-12-24 17:15:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:15:58,525 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 17:15:58,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:15:58,526 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 17:15:58,527 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 17:15:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:15:58,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 17:15:58,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:15:59,149 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 42 treesize of output 26 [2023-12-24 17:15:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 17 proven. 168 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-24 17:15:59,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:15:59,437 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 17:15:59,438 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 30 treesize of output 25 [2023-12-24 17:15:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-12-24 17:15:59,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:15:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687155492] [2023-12-24 17:15:59,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687155492] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 17:15:59,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:15:59,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-12-24 17:15:59,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327955974] [2023-12-24 17:15:59,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 17:15:59,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 17:15:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:15:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 17:15:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-24 17:15:59,465 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand has 20 states, 16 states have (on average 5.0) internal successors, (80), 18 states have internal predecessors, (80), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-24 17:16:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:00,061 INFO L93 Difference]: Finished difference Result 443 states and 610 transitions. [2023-12-24 17:16:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 17:16:00,062 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 5.0) internal successors, (80), 18 states have internal predecessors, (80), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) Word has length 104 [2023-12-24 17:16:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:00,064 INFO L225 Difference]: With dead ends: 443 [2023-12-24 17:16:00,064 INFO L226 Difference]: Without dead ends: 229 [2023-12-24 17:16:00,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2023-12-24 17:16:00,065 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 332 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:00,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 679 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 17:16:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-24 17:16:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 220. [2023-12-24 17:16:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 186 states have (on average 1.3494623655913978) internal successors, (251), 189 states have internal predecessors, (251), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-24 17:16:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 303 transitions. [2023-12-24 17:16:00,074 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 303 transitions. Word has length 104 [2023-12-24 17:16:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:00,074 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 303 transitions. [2023-12-24 17:16:00,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 5.0) internal successors, (80), 18 states have internal predecessors, (80), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-24 17:16:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 303 transitions. [2023-12-24 17:16:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:16:00,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:00,075 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:00,082 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 17:16:00,276 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 17:16:00,278 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:00,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash -635226280, now seen corresponding path program 1 times [2023-12-24 17:16:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516803902] [2023-12-24 17:16:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:00,279 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 17:16:00,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:00,283 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 17:16:00,285 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 17:16:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:00,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 17:16:00,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:00,894 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 19 [2023-12-24 17:16:00,899 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 11 [2023-12-24 17:16:01,511 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 52 treesize of output 32 [2023-12-24 17:16:01,513 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 31 [2023-12-24 17:16:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-24 17:16:01,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:03,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:03,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516803902] [2023-12-24 17:16:03,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516803902] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:03,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:16:03,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-12-24 17:16:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607577942] [2023-12-24 17:16:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:03,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:03,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-24 17:16:03,799 INFO L87 Difference]: Start difference. First operand 220 states and 303 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:05,441 INFO L93 Difference]: Finished difference Result 429 states and 590 transitions. [2023-12-24 17:16:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:16:05,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2023-12-24 17:16:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:05,449 INFO L225 Difference]: With dead ends: 429 [2023-12-24 17:16:05,450 INFO L226 Difference]: Without dead ends: 216 [2023-12-24 17:16:05,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-12-24 17:16:05,450 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 161 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:05,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 344 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 17:16:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-24 17:16:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2023-12-24 17:16:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 180 states have (on average 1.3444444444444446) internal successors, (242), 183 states have internal predecessors, (242), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-24 17:16:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 294 transitions. [2023-12-24 17:16:05,481 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 294 transitions. Word has length 104 [2023-12-24 17:16:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:05,481 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 294 transitions. [2023-12-24 17:16:05,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 294 transitions. [2023-12-24 17:16:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-24 17:16:05,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:05,482 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:05,497 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 (9)] Ended with exit code 0 [2023-12-24 17:16:05,688 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 17:16:05,689 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:05,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash -84360687, now seen corresponding path program 1 times [2023-12-24 17:16:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588556974] [2023-12-24 17:16:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:05,690 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 17:16:05,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:05,691 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 17:16:05,692 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 17:16:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:05,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 17:16:05,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:06,244 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 42 treesize of output 26 [2023-12-24 17:16:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 17 proven. 168 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-24 17:16:06,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:06,548 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 17:16:06,548 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 30 treesize of output 25 [2023-12-24 17:16:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-12-24 17:16:06,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:06,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588556974] [2023-12-24 17:16:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588556974] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 17:16:06,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:16:06,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-12-24 17:16:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970415602] [2023-12-24 17:16:06,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 17:16:06,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 17:16:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 17:16:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-24 17:16:06,581 INFO L87 Difference]: Start difference. First operand 214 states and 294 transitions. Second operand has 20 states, 16 states have (on average 4.625) internal successors, (74), 18 states have internal predecessors, (74), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-24 17:16:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:07,316 INFO L93 Difference]: Finished difference Result 383 states and 517 transitions. [2023-12-24 17:16:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 17:16:07,317 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 4.625) internal successors, (74), 18 states have internal predecessors, (74), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) Word has length 104 [2023-12-24 17:16:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:07,318 INFO L225 Difference]: With dead ends: 383 [2023-12-24 17:16:07,318 INFO L226 Difference]: Without dead ends: 176 [2023-12-24 17:16:07,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2023-12-24 17:16:07,319 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 336 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:07,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 666 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 17:16:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-24 17:16:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2023-12-24 17:16:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 138 states have internal predecessors, (177), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-24 17:16:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 223 transitions. [2023-12-24 17:16:07,327 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 223 transitions. Word has length 104 [2023-12-24 17:16:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:07,327 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 223 transitions. [2023-12-24 17:16:07,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 4.625) internal successors, (74), 18 states have internal predecessors, (74), 7 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 7 states have call successors, (26) [2023-12-24 17:16:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 223 transitions. [2023-12-24 17:16:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-24 17:16:07,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:07,328 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:07,336 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 17:16:07,528 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 17:16:07,529 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:07,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1602214575, now seen corresponding path program 1 times [2023-12-24 17:16:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:07,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66466758] [2023-12-24 17:16:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:07,530 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 17:16:07,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:07,531 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 17:16:07,532 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 17:16:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:07,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 17:16:07,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:07,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:07,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66466758] [2023-12-24 17:16:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66466758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:07,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:16:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407241284] [2023-12-24 17:16:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:07,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 17:16:07,737 INFO L87 Difference]: Start difference. First operand 167 states and 223 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:07,797 INFO L93 Difference]: Finished difference Result 369 states and 498 transitions. [2023-12-24 17:16:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 17:16:07,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 106 [2023-12-24 17:16:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:07,800 INFO L225 Difference]: With dead ends: 369 [2023-12-24 17:16:07,801 INFO L226 Difference]: Without dead ends: 209 [2023-12-24 17:16:07,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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 17:16:07,802 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 95 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:07,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 420 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:16:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-24 17:16:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2023-12-24 17:16:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 144 states have internal predecessors, (183), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-24 17:16:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2023-12-24 17:16:07,813 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 106 [2023-12-24 17:16:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:07,815 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2023-12-24 17:16:07,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2023-12-24 17:16:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 17:16:07,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:07,816 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:07,837 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 17:16:08,022 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 17:16:08,023 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:08,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1568819976, now seen corresponding path program 1 times [2023-12-24 17:16:08,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:08,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962507945] [2023-12-24 17:16:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:08,025 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 17:16:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:08,030 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 17:16:08,034 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 17:16:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:08,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 17:16:08,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:08,724 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 20 treesize of output 12 [2023-12-24 17:16:09,111 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 18 treesize of output 14 [2023-12-24 17:16:10,001 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 54 treesize of output 42 [2023-12-24 17:16:10,004 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 64 treesize of output 44 [2023-12-24 17:16:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-24 17:16:10,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:10,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962507945] [2023-12-24 17:16:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962507945] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:10,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:16:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2023-12-24 17:16:10,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304991646] [2023-12-24 17:16:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:10,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:10,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:10,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-24 17:16:10,413 INFO L87 Difference]: Start difference. First operand 173 states and 229 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:10,507 INFO L93 Difference]: Finished difference Result 179 states and 236 transitions. [2023-12-24 17:16:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:16:10,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2023-12-24 17:16:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:10,510 INFO L225 Difference]: With dead ends: 179 [2023-12-24 17:16:10,510 INFO L226 Difference]: Without dead ends: 177 [2023-12-24 17:16:10,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-12-24 17:16:10,511 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 47 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:10,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 373 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:16:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-24 17:16:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-12-24 17:16:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 148 states have internal predecessors, (187), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-24 17:16:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 233 transitions. [2023-12-24 17:16:10,543 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 233 transitions. Word has length 108 [2023-12-24 17:16:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:10,544 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 233 transitions. [2023-12-24 17:16:10,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 233 transitions. [2023-12-24 17:16:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 17:16:10,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:10,545 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:10,568 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 17:16:10,753 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 17:16:10,753 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:10,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1568760394, now seen corresponding path program 1 times [2023-12-24 17:16:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601890004] [2023-12-24 17:16:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:10,754 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 17:16:10,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:10,755 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 17:16:10,756 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 17:16:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:11,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 17:16:11,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:11,142 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 18 treesize of output 14 [2023-12-24 17:16:11,236 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 54 treesize of output 42 [2023-12-24 17:16:11,238 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 54 treesize of output 34 [2023-12-24 17:16:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:11,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:11,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601890004] [2023-12-24 17:16:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601890004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:11,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:16:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561302907] [2023-12-24 17:16:11,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:11,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 17:16:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 17:16:11,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 17:16:11,252 INFO L87 Difference]: Start difference. First operand 177 states and 233 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:11,413 INFO L93 Difference]: Finished difference Result 564 states and 736 transitions. [2023-12-24 17:16:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 17:16:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2023-12-24 17:16:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:11,416 INFO L225 Difference]: With dead ends: 564 [2023-12-24 17:16:11,416 INFO L226 Difference]: Without dead ends: 394 [2023-12-24 17:16:11,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 17:16:11,420 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:11,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 571 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:16:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-24 17:16:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 383. [2023-12-24 17:16:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 311 states have (on average 1.2604501607717042) internal successors, (392), 314 states have internal predecessors, (392), 53 states have call successors, (53), 18 states have call predecessors, (53), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 498 transitions. [2023-12-24 17:16:11,443 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 498 transitions. Word has length 108 [2023-12-24 17:16:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:11,443 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 498 transitions. [2023-12-24 17:16:11,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 498 transitions. [2023-12-24 17:16:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 17:16:11,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:11,444 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:11,462 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 17:16:11,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 17:16:11,653 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:11,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1511502092, now seen corresponding path program 1 times [2023-12-24 17:16:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714079971] [2023-12-24 17:16:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:11,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:16:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:11,655 INFO L229 MonitoredProcess]: Starting monitored process 14 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 17:16:11,656 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 (14)] Waiting until timeout for monitored process [2023-12-24 17:16:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:11,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 17:16:11,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:11,908 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 17 treesize of output 13 [2023-12-24 17:16:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:11,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:11,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:11,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714079971] [2023-12-24 17:16:11,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714079971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:11,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:11,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:16:11,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942097892] [2023-12-24 17:16:11,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:11,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:11,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:11,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 17:16:11,955 INFO L87 Difference]: Start difference. First operand 383 states and 498 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:12,113 INFO L93 Difference]: Finished difference Result 753 states and 978 transitions. [2023-12-24 17:16:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:16:12,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2023-12-24 17:16:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:12,118 INFO L225 Difference]: With dead ends: 753 [2023-12-24 17:16:12,118 INFO L226 Difference]: Without dead ends: 413 [2023-12-24 17:16:12,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 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 17:16:12,119 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 94 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:12,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 478 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:16:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-12-24 17:16:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 399. [2023-12-24 17:16:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 325 states have (on average 1.2492307692307691) internal successors, (406), 328 states have internal predecessors, (406), 53 states have call successors, (53), 20 states have call predecessors, (53), 20 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 512 transitions. [2023-12-24 17:16:12,146 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 512 transitions. Word has length 108 [2023-12-24 17:16:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:12,146 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 512 transitions. [2023-12-24 17:16:12,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2023-12-24 17:16:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 17:16:12,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:12,147 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:12,156 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 (14)] Forceful destruction successful, exit code 0 [2023-12-24 17:16:12,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 17:16:12,354 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:12,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1974118578, now seen corresponding path program 1 times [2023-12-24 17:16:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:12,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635089667] [2023-12-24 17:16:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:12,356 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 17:16:12,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:12,357 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 17:16:12,364 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 17:16:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:12,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 17:16:12,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:12,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:12,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635089667] [2023-12-24 17:16:12,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635089667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:12,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:12,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:16:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644519367] [2023-12-24 17:16:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:12,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:12,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:12,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 17:16:12,604 INFO L87 Difference]: Start difference. First operand 399 states and 512 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:12,659 INFO L93 Difference]: Finished difference Result 789 states and 1012 transitions. [2023-12-24 17:16:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:16:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2023-12-24 17:16:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:12,660 INFO L225 Difference]: With dead ends: 789 [2023-12-24 17:16:12,661 INFO L226 Difference]: Without dead ends: 433 [2023-12-24 17:16:12,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 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 17:16:12,661 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 31 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:12,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 427 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:16:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-12-24 17:16:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 411. [2023-12-24 17:16:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 337 states have (on average 1.2403560830860534) internal successors, (418), 340 states have internal predecessors, (418), 53 states have call successors, (53), 20 states have call predecessors, (53), 20 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 524 transitions. [2023-12-24 17:16:12,695 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 524 transitions. Word has length 108 [2023-12-24 17:16:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:12,695 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 524 transitions. [2023-12-24 17:16:12,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 524 transitions. [2023-12-24 17:16:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 17:16:12,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:12,697 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:12,715 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 17:16:12,903 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 17:16:12,904 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:12,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash 253719652, now seen corresponding path program 1 times [2023-12-24 17:16:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995924636] [2023-12-24 17:16:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:12,905 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 17:16:12,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:12,922 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 17:16:12,956 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 17:16:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:13,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 17:16:13,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:13,154 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 17 treesize of output 9 [2023-12-24 17:16:13,157 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 17 treesize of output 9 [2023-12-24 17:16:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:13,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:13,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995924636] [2023-12-24 17:16:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995924636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:13,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:13,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 17:16:13,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684863961] [2023-12-24 17:16:13,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:13,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 17:16:13,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:13,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 17:16:13,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 17:16:13,391 INFO L87 Difference]: Start difference. First operand 411 states and 524 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:13,499 INFO L93 Difference]: Finished difference Result 985 states and 1273 transitions. [2023-12-24 17:16:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 17:16:13,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 108 [2023-12-24 17:16:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:13,501 INFO L225 Difference]: With dead ends: 985 [2023-12-24 17:16:13,501 INFO L226 Difference]: Without dead ends: 617 [2023-12-24 17:16:13,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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 17:16:13,502 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 79 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:13,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 329 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:16:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-12-24 17:16:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 487. [2023-12-24 17:16:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 413 states have (on average 1.2639225181598064) internal successors, (522), 415 states have internal predecessors, (522), 53 states have call successors, (53), 20 states have call predecessors, (53), 20 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 628 transitions. [2023-12-24 17:16:13,540 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 628 transitions. Word has length 108 [2023-12-24 17:16:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:13,541 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 628 transitions. [2023-12-24 17:16:13,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 628 transitions. [2023-12-24 17:16:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-24 17:16:13,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:13,542 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:13,566 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 17:16:13,749 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 17:16:13,749 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:13,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1392524091, now seen corresponding path program 1 times [2023-12-24 17:16:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:13,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753883890] [2023-12-24 17:16:13,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:13,750 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 17:16:13,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:13,751 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 17:16:13,753 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 17:16:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:13,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 17:16:13,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:13,959 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 17 treesize of output 9 [2023-12-24 17:16:13,963 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 17 treesize of output 9 [2023-12-24 17:16:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:14,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:14,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:14,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753883890] [2023-12-24 17:16:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753883890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:14,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 17:16:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638627222] [2023-12-24 17:16:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:14,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 17:16:14,175 INFO L87 Difference]: Start difference. First operand 487 states and 628 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:14,334 INFO L93 Difference]: Finished difference Result 739 states and 951 transitions. [2023-12-24 17:16:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 17:16:14,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 110 [2023-12-24 17:16:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:14,336 INFO L225 Difference]: With dead ends: 739 [2023-12-24 17:16:14,336 INFO L226 Difference]: Without dead ends: 517 [2023-12-24 17:16:14,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 17:16:14,336 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 107 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:14,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 414 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:16:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-12-24 17:16:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 449. [2023-12-24 17:16:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 375 states have (on average 1.2506666666666666) internal successors, (469), 377 states have internal predecessors, (469), 53 states have call successors, (53), 20 states have call predecessors, (53), 20 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 575 transitions. [2023-12-24 17:16:14,369 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 575 transitions. Word has length 110 [2023-12-24 17:16:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:14,370 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 575 transitions. [2023-12-24 17:16:14,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 575 transitions. [2023-12-24 17:16:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-24 17:16:14,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:14,371 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:14,379 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 17:16:14,577 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 17:16:14,577 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:14,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1411856197, now seen corresponding path program 1 times [2023-12-24 17:16:14,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:14,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560910212] [2023-12-24 17:16:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:14,578 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 17:16:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:14,579 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 17:16:14,581 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 17:16:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:14,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 17:16:14,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 17:16:14,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:14,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:14,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560910212] [2023-12-24 17:16:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560910212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 17:16:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243826924] [2023-12-24 17:16:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:14,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 17:16:14,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:14,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 17:16:14,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 17:16:14,823 INFO L87 Difference]: Start difference. First operand 449 states and 575 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:14,933 INFO L93 Difference]: Finished difference Result 877 states and 1115 transitions. [2023-12-24 17:16:14,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 17:16:14,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2023-12-24 17:16:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:14,950 INFO L225 Difference]: With dead ends: 877 [2023-12-24 17:16:14,950 INFO L226 Difference]: Without dead ends: 509 [2023-12-24 17:16:14,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-24 17:16:14,951 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 41 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:14,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 543 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:16:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-12-24 17:16:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 453. [2023-12-24 17:16:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 379 states have (on average 1.2480211081794195) internal successors, (473), 381 states have internal predecessors, (473), 53 states have call successors, (53), 20 states have call predecessors, (53), 20 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 579 transitions. [2023-12-24 17:16:14,971 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 579 transitions. Word has length 111 [2023-12-24 17:16:14,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:14,971 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 579 transitions. [2023-12-24 17:16:14,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 579 transitions. [2023-12-24 17:16:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-24 17:16:14,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:14,972 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:16:14,996 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 (18)] Ended with exit code 0 [2023-12-24 17:16:15,179 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 17:16:15,179 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:15,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1430407344, now seen corresponding path program 1 times [2023-12-24 17:16:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404717333] [2023-12-24 17:16:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:15,181 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 17:16:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:15,183 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 17:16:15,186 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 17:16:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:15,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 17:16:15,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:15,669 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 33 treesize of output 21 [2023-12-24 17:16:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 4 proven. 172 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-12-24 17:16:15,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:15,851 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 17:16:15,851 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 20 treesize of output 19 [2023-12-24 17:16:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-24 17:16:15,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:15,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404717333] [2023-12-24 17:16:15,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404717333] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 17:16:15,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:16:15,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-12-24 17:16:15,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987147852] [2023-12-24 17:16:15,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 17:16:15,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 17:16:15,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:15,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 17:16:15,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-24 17:16:15,931 INFO L87 Difference]: Start difference. First operand 453 states and 579 transitions. Second operand has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-24 17:16:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:16,301 INFO L93 Difference]: Finished difference Result 855 states and 1072 transitions. [2023-12-24 17:16:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 17:16:16,302 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) Word has length 113 [2023-12-24 17:16:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:16,309 INFO L225 Difference]: With dead ends: 855 [2023-12-24 17:16:16,310 INFO L226 Difference]: Without dead ends: 483 [2023-12-24 17:16:16,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2023-12-24 17:16:16,311 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 250 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:16,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 384 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 17:16:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-12-24 17:16:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 433. [2023-12-24 17:16:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 356 states have (on average 1.2078651685393258) internal successors, (430), 358 states have internal predecessors, (430), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 536 transitions. [2023-12-24 17:16:16,350 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 536 transitions. Word has length 113 [2023-12-24 17:16:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:16,350 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 536 transitions. [2023-12-24 17:16:16,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 2 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-24 17:16:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 536 transitions. [2023-12-24 17:16:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-24 17:16:16,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:16,356 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:16:16,376 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 17:16:16,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 17:16:16,563 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:16,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2043157450, now seen corresponding path program 1 times [2023-12-24 17:16:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:16,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315431662] [2023-12-24 17:16:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:16,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:16:16,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:16,565 INFO L229 MonitoredProcess]: Starting monitored process 20 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 17:16:16,568 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 (20)] Waiting until timeout for monitored process [2023-12-24 17:16:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:16,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 17:16:16,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:17,866 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 19 [2023-12-24 17:16:17,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 11 [2023-12-24 17:16:17,910 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 18 treesize of output 14 [2023-12-24 17:16:17,914 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 17:16:18,041 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 19 treesize of output 11 [2023-12-24 17:16:18,046 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 20 treesize of output 12 [2023-12-24 17:16:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 24 proven. 704 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-12-24 17:16:18,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:18,425 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 30 treesize of output 26 [2023-12-24 17:16:18,427 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 47 treesize of output 43 [2023-12-24 17:16:18,535 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 110 treesize of output 102 [2023-12-24 17:16:19,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315431662] [2023-12-24 17:16:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315431662] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1717099244] [2023-12-24 17:16:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:19,178 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 17:16:19,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 17:16:19,248 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 17:16:19,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-24 17:16:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:19,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 17:16:19,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:21,580 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 48 treesize of output 36 [2023-12-24 17:16:21,734 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 22 treesize of output 14 [2023-12-24 17:16:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 11 proven. 717 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-12-24 17:16:22,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1327 trivial. 0 not checked. [2023-12-24 17:16:22,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1717099244] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:16:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 8] total 16 [2023-12-24 17:16:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101189231] [2023-12-24 17:16:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:22,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 17:16:22,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:22,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 17:16:22,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-12-24 17:16:22,285 INFO L87 Difference]: Start difference. First operand 433 states and 536 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:22,344 INFO L93 Difference]: Finished difference Result 827 states and 1020 transitions. [2023-12-24 17:16:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 17:16:22,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 215 [2023-12-24 17:16:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:22,346 INFO L225 Difference]: With dead ends: 827 [2023-12-24 17:16:22,346 INFO L226 Difference]: Without dead ends: 479 [2023-12-24 17:16:22,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-12-24 17:16:22,347 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 105 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:22,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 200 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:16:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-12-24 17:16:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 407. [2023-12-24 17:16:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 330 states have (on average 1.1818181818181819) internal successors, (390), 332 states have internal predecessors, (390), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 496 transitions. [2023-12-24 17:16:22,370 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 496 transitions. Word has length 215 [2023-12-24 17:16:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:22,371 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 496 transitions. [2023-12-24 17:16:22,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 496 transitions. [2023-12-24 17:16:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-24 17:16:22,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:22,373 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:16:22,383 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 (20)] Forceful destruction successful, exit code 0 [2023-12-24 17:16:22,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-12-24 17:16:22,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 17:16:22,783 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:22,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1239637727, now seen corresponding path program 1 times [2023-12-24 17:16:22,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:22,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913096405] [2023-12-24 17:16:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:22,784 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 17:16:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:22,785 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 17:16:22,786 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 17:16:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:23,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 17:16:23,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:24,283 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 19 [2023-12-24 17:16:24,286 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 11 [2023-12-24 17:16:24,326 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 18 treesize of output 14 [2023-12-24 17:16:24,328 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 17:16:24,456 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 19 treesize of output 11 [2023-12-24 17:16:24,459 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 20 treesize of output 12 [2023-12-24 17:16:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 13 proven. 717 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-12-24 17:16:24,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:24,875 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 30 treesize of output 26 [2023-12-24 17:16:24,876 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 47 treesize of output 43 [2023-12-24 17:16:24,955 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 110 treesize of output 102 [2023-12-24 17:16:25,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913096405] [2023-12-24 17:16:25,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913096405] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1376554139] [2023-12-24 17:16:25,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:25,604 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 17:16:25,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 17:16:25,605 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 17:16:25,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-24 17:16:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:26,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 17:16:26,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:27,795 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 48 treesize of output 36 [2023-12-24 17:16:27,936 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 22 treesize of output 14 [2023-12-24 17:16:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 13 proven. 717 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-12-24 17:16:28,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 1327 trivial. 0 not checked. [2023-12-24 17:16:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1376554139] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:16:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 8] total 15 [2023-12-24 17:16:28,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077393145] [2023-12-24 17:16:28,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:28,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 17:16:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:28,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 17:16:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-24 17:16:28,482 INFO L87 Difference]: Start difference. First operand 407 states and 496 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:28,536 INFO L93 Difference]: Finished difference Result 653 states and 801 transitions. [2023-12-24 17:16:28,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 17:16:28,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 217 [2023-12-24 17:16:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:28,538 INFO L225 Difference]: With dead ends: 653 [2023-12-24 17:16:28,538 INFO L226 Difference]: Without dead ends: 443 [2023-12-24 17:16:28,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-24 17:16:28,539 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 101 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:28,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 238 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:16:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-12-24 17:16:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 407. [2023-12-24 17:16:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 330 states have (on average 1.1757575757575758) internal successors, (388), 332 states have internal predecessors, (388), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 494 transitions. [2023-12-24 17:16:28,563 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 494 transitions. Word has length 217 [2023-12-24 17:16:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:28,564 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 494 transitions. [2023-12-24 17:16:28,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 494 transitions. [2023-12-24 17:16:28,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-24 17:16:28,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:28,565 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:16:28,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-12-24 17:16:28,791 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 17:16:28,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 17:16:28,986 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:28,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:28,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1334930643, now seen corresponding path program 1 times [2023-12-24 17:16:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:28,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296062443] [2023-12-24 17:16:28,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:28,987 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 17:16:28,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:28,988 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 17:16:28,998 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 17:16:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:29,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 17:16:29,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1344 trivial. 0 not checked. [2023-12-24 17:16:29,394 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:29,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:29,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296062443] [2023-12-24 17:16:29,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296062443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:29,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:29,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 17:16:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152280738] [2023-12-24 17:16:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:29,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 17:16:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:29,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 17:16:29,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 17:16:29,397 INFO L87 Difference]: Start difference. First operand 407 states and 494 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:29,446 INFO L93 Difference]: Finished difference Result 625 states and 766 transitions. [2023-12-24 17:16:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 17:16:29,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 217 [2023-12-24 17:16:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:29,447 INFO L225 Difference]: With dead ends: 625 [2023-12-24 17:16:29,447 INFO L226 Difference]: Without dead ends: 415 [2023-12-24 17:16:29,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 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 17:16:29,449 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:29,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 300 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:16:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-24 17:16:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 407. [2023-12-24 17:16:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 330 states have (on average 1.1696969696969697) internal successors, (386), 332 states have internal predecessors, (386), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 492 transitions. [2023-12-24 17:16:29,472 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 492 transitions. Word has length 217 [2023-12-24 17:16:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:29,472 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 492 transitions. [2023-12-24 17:16:29,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 492 transitions. [2023-12-24 17:16:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-24 17:16:29,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:29,474 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:16:29,494 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 (24)] Forceful destruction successful, exit code 0 [2023-12-24 17:16:29,684 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 17:16:29,684 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:29,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash 525584017, now seen corresponding path program 1 times [2023-12-24 17:16:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:29,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313003338] [2023-12-24 17:16:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:29,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 17:16:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:29,687 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 17:16:29,689 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 17:16:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:30,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 17:16:30,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1344 trivial. 0 not checked. [2023-12-24 17:16:30,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:30,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313003338] [2023-12-24 17:16:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313003338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:30,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:30,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:16:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559155047] [2023-12-24 17:16:30,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:30,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:30,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 17:16:30,111 INFO L87 Difference]: Start difference. First operand 407 states and 492 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:30,187 INFO L93 Difference]: Finished difference Result 625 states and 762 transitions. [2023-12-24 17:16:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:16:30,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 217 [2023-12-24 17:16:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:30,189 INFO L225 Difference]: With dead ends: 625 [2023-12-24 17:16:30,189 INFO L226 Difference]: Without dead ends: 415 [2023-12-24 17:16:30,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 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 17:16:30,190 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 16 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:30,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 395 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:16:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-24 17:16:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 407. [2023-12-24 17:16:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 330 states have (on average 1.1636363636363636) internal successors, (384), 332 states have internal predecessors, (384), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-24 17:16:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 490 transitions. [2023-12-24 17:16:30,211 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 490 transitions. Word has length 217 [2023-12-24 17:16:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:30,211 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 490 transitions. [2023-12-24 17:16:30,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 490 transitions. [2023-12-24 17:16:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-24 17:16:30,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:30,212 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 17:16:30,238 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 17:16:30,422 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 17:16:30,423 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:30,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 582842319, now seen corresponding path program 1 times [2023-12-24 17:16:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:30,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559398559] [2023-12-24 17:16:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:30,424 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 17:16:30,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:30,425 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 17:16:30,452 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 17:16:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:30,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 17:16:30,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:31,602 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 17 [2023-12-24 17:16:31,714 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 26 treesize of output 18 [2023-12-24 17:16:31,743 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 44 treesize of output 28 [2023-12-24 17:16:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 78 proven. 305 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-24 17:16:31,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2023-12-24 17:16:32,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559398559] [2023-12-24 17:16:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559398559] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:16:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 24 [2023-12-24 17:16:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530521211] [2023-12-24 17:16:32,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:32,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 17:16:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 17:16:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2023-12-24 17:16:32,078 INFO L87 Difference]: Start difference. First operand 407 states and 490 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:32,515 INFO L93 Difference]: Finished difference Result 831 states and 1002 transitions. [2023-12-24 17:16:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 17:16:32,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 217 [2023-12-24 17:16:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:32,517 INFO L225 Difference]: With dead ends: 831 [2023-12-24 17:16:32,517 INFO L226 Difference]: Without dead ends: 621 [2023-12-24 17:16:32,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 17:16:32,518 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 198 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:32,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1160 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 17:16:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2023-12-24 17:16:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 505. [2023-12-24 17:16:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 417 states have (on average 1.1750599520383693) internal successors, (490), 420 states have internal predecessors, (490), 60 states have call successors, (60), 27 states have call predecessors, (60), 27 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 17:16:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 610 transitions. [2023-12-24 17:16:32,545 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 610 transitions. Word has length 217 [2023-12-24 17:16:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:32,545 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 610 transitions. [2023-12-24 17:16:32,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 610 transitions. [2023-12-24 17:16:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-24 17:16:32,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:32,547 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 17:16:32,556 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 17:16:32,756 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 17:16:32,756 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:32,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash -428274931, now seen corresponding path program 1 times [2023-12-24 17:16:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858556511] [2023-12-24 17:16:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:32,757 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 17:16:32,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:32,758 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 17:16:32,759 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 17:16:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:33,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 17:16:33,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:34,114 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 44 treesize of output 28 [2023-12-24 17:16:34,117 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 22 treesize of output 14 [2023-12-24 17:16:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 81 proven. 302 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-24 17:16:34,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2023-12-24 17:16:34,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:34,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858556511] [2023-12-24 17:16:34,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858556511] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:34,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:16:34,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2023-12-24 17:16:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749951797] [2023-12-24 17:16:34,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-12-24 17:16:34,461 INFO L87 Difference]: Start difference. First operand 505 states and 610 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:34,668 INFO L93 Difference]: Finished difference Result 903 states and 1090 transitions. [2023-12-24 17:16:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 17:16:34,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 217 [2023-12-24 17:16:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:34,671 INFO L225 Difference]: With dead ends: 903 [2023-12-24 17:16:34,671 INFO L226 Difference]: Without dead ends: 595 [2023-12-24 17:16:34,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-12-24 17:16:34,672 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 160 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:34,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 441 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:16:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-12-24 17:16:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 497. [2023-12-24 17:16:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 409 states have (on average 1.1711491442542787) internal successors, (479), 412 states have internal predecessors, (479), 60 states have call successors, (60), 27 states have call predecessors, (60), 27 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 17:16:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 599 transitions. [2023-12-24 17:16:34,700 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 599 transitions. Word has length 217 [2023-12-24 17:16:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:34,700 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 599 transitions. [2023-12-24 17:16:34,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 599 transitions. [2023-12-24 17:16:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-24 17:16:34,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:34,702 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 17:16:34,712 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 17:16:34,911 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 17:16:34,912 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:34,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1969045713, now seen corresponding path program 1 times [2023-12-24 17:16:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:34,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140254889] [2023-12-24 17:16:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:34,913 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 17:16:34,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:34,914 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 17:16:34,915 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 17:16:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:35,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 17:16:35,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:36,188 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 45 treesize of output 29 [2023-12-24 17:16:36,191 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 23 treesize of output 15 [2023-12-24 17:16:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 81 proven. 302 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-24 17:16:36,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:16:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2023-12-24 17:16:36,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140254889] [2023-12-24 17:16:36,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140254889] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:16:36,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:16:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2023-12-24 17:16:36,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935104301] [2023-12-24 17:16:36,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:36,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:36,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:36,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-12-24 17:16:36,564 INFO L87 Difference]: Start difference. First operand 497 states and 599 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:36,784 INFO L93 Difference]: Finished difference Result 896 states and 1078 transitions. [2023-12-24 17:16:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:16:36,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 217 [2023-12-24 17:16:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:36,787 INFO L225 Difference]: With dead ends: 896 [2023-12-24 17:16:36,787 INFO L226 Difference]: Without dead ends: 596 [2023-12-24 17:16:36,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-12-24 17:16:36,788 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 97 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:36,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 445 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:16:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2023-12-24 17:16:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 497. [2023-12-24 17:16:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 409 states have (on average 1.1662591687041566) internal successors, (477), 412 states have internal predecessors, (477), 60 states have call successors, (60), 27 states have call predecessors, (60), 27 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 17:16:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 597 transitions. [2023-12-24 17:16:36,817 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 597 transitions. Word has length 217 [2023-12-24 17:16:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:36,817 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 597 transitions. [2023-12-24 17:16:36,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 597 transitions. [2023-12-24 17:16:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-24 17:16:36,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:36,818 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 17:16:36,830 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 17:16:37,028 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 17:16:37,029 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:37,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash 957928463, now seen corresponding path program 1 times [2023-12-24 17:16:37,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140765775] [2023-12-24 17:16:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:37,030 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 17:16:37,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:37,031 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 17:16:37,068 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 17:16:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:37,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 17:16:37,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:37,543 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 17:16:37,587 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 24 treesize of output 16 [2023-12-24 17:16:37,605 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 22 treesize of output 14 [2023-12-24 17:16:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2023-12-24 17:16:37,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:37,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:37,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140765775] [2023-12-24 17:16:37,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140765775] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:37,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:37,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 17:16:37,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002018554] [2023-12-24 17:16:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:37,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 17:16:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 17:16:37,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-24 17:16:37,681 INFO L87 Difference]: Start difference. First operand 497 states and 597 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:38,109 INFO L93 Difference]: Finished difference Result 912 states and 1093 transitions. [2023-12-24 17:16:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 17:16:38,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 217 [2023-12-24 17:16:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:38,112 INFO L225 Difference]: With dead ends: 912 [2023-12-24 17:16:38,112 INFO L226 Difference]: Without dead ends: 612 [2023-12-24 17:16:38,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-24 17:16:38,112 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 162 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:38,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1158 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 17:16:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2023-12-24 17:16:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 593. [2023-12-24 17:16:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 478 states have (on average 1.1506276150627615) internal successors, (550), 483 states have internal predecessors, (550), 78 states have call successors, (78), 36 states have call predecessors, (78), 36 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-24 17:16:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 706 transitions. [2023-12-24 17:16:38,148 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 706 transitions. Word has length 217 [2023-12-24 17:16:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:38,148 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 706 transitions. [2023-12-24 17:16:38,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 706 transitions. [2023-12-24 17:16:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-24 17:16:38,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:16:38,149 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:16:38,170 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 17:16:38,359 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 17:16:38,359 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:16:38,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:16:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash -787839588, now seen corresponding path program 1 times [2023-12-24 17:16:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:16:38,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814092206] [2023-12-24 17:16:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:16:38,360 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 17:16:38,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:16:38,361 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 17:16:38,407 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 17:16:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:16:38,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 17:16:38,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:16:38,853 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 18 treesize of output 14 [2023-12-24 17:16:38,909 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 54 treesize of output 42 [2023-12-24 17:16:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2023-12-24 17:16:38,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:16:38,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:16:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814092206] [2023-12-24 17:16:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814092206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:16:38,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:16:38,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:16:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532366049] [2023-12-24 17:16:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:16:38,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:16:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:16:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:16:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 17:16:38,921 INFO L87 Difference]: Start difference. First operand 593 states and 706 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:16:39,013 INFO L93 Difference]: Finished difference Result 978 states and 1165 transitions. [2023-12-24 17:16:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 17:16:39,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 219 [2023-12-24 17:16:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:16:39,015 INFO L225 Difference]: With dead ends: 978 [2023-12-24 17:16:39,015 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 17:16:39,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 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 17:16:39,016 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 79 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 17:16:39,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 437 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 17:16:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 17:16:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 17:16:39,016 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 17:16:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 17:16:39,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2023-12-24 17:16:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:16:39,017 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 17:16:39,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 17:16:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 17:16:39,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 17:16:39,019 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 17:16:39,030 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 17:16:39,219 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 17:16:39,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 17:16:52,273 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L52-2(lines 52 54) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-24 17:16:52,273 INFO L899 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))))) (let ((.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse7 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse3 (bvsle .cse11 (_ bv1 32))) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse1 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse0 ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (.cse8 (bvsge .cse11 (_ bv1 32)))) (or (and (bvsle ((_ zero_extend 24) .cse0) (_ bv0 32)) (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse1)))) .cse2 .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse7) .cse8) (let ((.cse9 ((_ sign_extend 16) (_ bv16 16))) (.cse10 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse9)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse9) .cse2 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse7)) .cse3 .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse10) .cse6 (= ((_ sign_extend 24) (_ bv255 8)) .cse1) (= .cse0 (_ bv0 8)) .cse8 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse10))))))) [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-3(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-5(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-7(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-8(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-9(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-10(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-11(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-13(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-15(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))))) (let ((.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse7 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse3 (bvsle .cse11 (_ bv1 32))) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse1 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse0 ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (.cse8 (bvsge .cse11 (_ bv1 32)))) (or (and (bvsle ((_ zero_extend 24) .cse0) (_ bv0 32)) (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse1)))) .cse2 .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse7) .cse8) (let ((.cse9 ((_ sign_extend 16) (_ bv16 16))) (.cse10 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse9)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse9) .cse2 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse7)) .cse3 .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse10) .cse6 (= ((_ sign_extend 24) (_ bv255 8)) .cse1) (= .cse0 (_ bv0 8)) .cse8 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse10))))))) [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-17(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,274 INFO L899 garLoopResultBuilder]: For program point L103-18(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-19(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-20(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-22(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-23(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-24(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-26(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-28(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-29(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-31(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-33(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-35(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-37(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-38(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-40(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-41(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-43(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-44(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L103-46(line 103) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))))) (let ((.cse1 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse6 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse2 (bvsle .cse10 (_ bv1 32))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse0 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse7 (bvsge .cse10 (_ bv1 32)))) (or (and (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse0)))) .cse1 .cse2 .cse3 .cse4 .cse5 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse6) .cse7) (let ((.cse8 ((_ sign_extend 16) (_ bv16 16))) (.cse9 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse8)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse8) .cse1 (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse6)) .cse2 .cse3 .cse4 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse9) .cse5 (= ((_ sign_extend 24) (_ bv255 8)) .cse0) .cse7 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse9))))))) [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-12-24 17:16:52,275 INFO L899 garLoopResultBuilder]: For program point L56-2(lines 56 60) no Hoare annotation was computed. [2023-12-24 17:16:52,276 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))))) (let ((.cse1 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse2 (= ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset)) |ULTIMATE.start_updateVariables_#t~mem48#1|)) (.cse7 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse3 (bvsle .cse11 (_ bv1 32))) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse0 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse8 (bvsge .cse11 (_ bv1 32)))) (or (and (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse0)))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse7) .cse8) (let ((.cse9 ((_ sign_extend 16) (_ bv16 16))) (.cse10 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse9)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse9) .cse1 .cse2 (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse7)) .cse3 .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse10) .cse6 (= ((_ sign_extend 24) (_ bv255 8)) .cse0) .cse8 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse10))))))) [2023-12-24 17:16:52,276 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-24 17:16:52,276 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-24 17:16:52,276 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-12-24 17:16:52,276 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 17:16:52,276 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))))) (let ((.cse1 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32))) (.cse8 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse3 (bvsle .cse10 (_ bv1 32))) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse9 (bvsge .cse10 (_ bv1 32)))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv16 16))) (.cse6 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse0)) .cse1 (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse0) .cse2 .cse3 .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse6) .cse7 (= ((_ sign_extend 24) (_ bv255 8)) .cse8) .cse9 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse6)))) (and .cse1 (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse8)))) .cse2 .cse3 .cse4 .cse5 .cse7 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) .cse9)))) [2023-12-24 17:16:52,276 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-24 17:16:52,276 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-24 17:16:52,276 INFO L899 garLoopResultBuilder]: For program point L59-2(line 59) no Hoare annotation was computed. [2023-12-24 17:16:52,276 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 115) the Hoare annotation is: (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse19 ((_ extract 7 0) (select (select |#memory_int#2| ~var_1_3_Pointer~0.base) ~var_1_3_Pointer~0.offset))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))) (.cse20 (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)) (.cse9 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse1 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32))) (.cse11 (= .cse20 ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse9))))) (.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse3 (= .cse13 (_ bv0 32))) (.cse14 (bvsle .cse21 (_ bv1 32))) (.cse5 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse6 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse15 (= ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))) ((_ zero_extend 16) ((_ zero_extend 8) .cse19)))) (.cse8 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse16 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse4)) (.cse17 (bvsge .cse21 (_ bv1 32))) (.cse10 (not (let ((.cse18 ((_ zero_extend 16) ((_ extract 15 0) .cse20)))) (bvsge (bvsdiv .cse18 ((_ zero_extend 24) .cse19)) .cse18))))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv16 16))) (.cse7 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse0)) .cse1 (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse0) .cse2 .cse3 (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse4)) .cse5 .cse6 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse7) .cse8 (= ((_ sign_extend 24) (_ bv255 8)) .cse9) .cse10 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse7)))) (let ((.cse12 (= (_ bv0 8) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (and .cse1 .cse11 .cse2 (or .cse12 (= .cse13 (_ bv1 32))) .cse14 .cse5 .cse6 .cse15 .cse8 .cse16 .cse17 (or .cse3 (not .cse12)))) (and .cse1 .cse11 .cse2 .cse3 .cse14 .cse5 .cse6 .cse15 .cse8 .cse16 .cse17 .cse10)))) [2023-12-24 17:16:52,276 INFO L899 garLoopResultBuilder]: For program point L109-3(lines 109 115) no Hoare annotation was computed. [2023-12-24 17:16:52,277 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))))) (let ((.cse1 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32))) (.cse8 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse3 (bvsle .cse10 (_ bv1 32))) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse9 (bvsge .cse10 (_ bv1 32)))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv16 16))) (.cse6 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse0)) .cse1 (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse0) .cse2 .cse3 .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse6) .cse7 (= ((_ sign_extend 24) (_ bv255 8)) .cse8) .cse9 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse6)))) (and .cse1 (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse8)))) .cse2 .cse3 .cse4 .cse5 .cse7 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) .cse9)))) [2023-12-24 17:16:52,277 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-24 17:16:52,277 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))))) (let ((.cse1 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32))) (.cse8 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse3 (bvsle .cse10 (_ bv1 32))) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse9 (bvsge .cse10 (_ bv1 32)))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv16 16))) (.cse6 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse0)) .cse1 (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse0) .cse2 .cse3 .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse6) .cse7 (= ((_ sign_extend 24) (_ bv255 8)) .cse8) .cse9 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse6)))) (and .cse1 (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse8)))) .cse2 .cse3 .cse4 .cse5 .cse7 .cse9)))) [2023-12-24 17:16:52,277 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-12-24 17:16:52,277 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))))) (let ((.cse0 ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (.cse8 (= .cse16 (_ bv1 32))) (.cse13 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) (.cse15 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse1 (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse15))))) (.cse3 (bvsle .cse17 (_ bv1 32))) (.cse7 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse13)) (.cse9 (bvsge .cse17 (_ bv1 32))) (.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse10 (= .cse16 (_ bv0 32))) (.cse11 (or (= .cse0 (_ bv0 8)) .cse8)) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|))) (or (and (bvsle ((_ zero_extend 24) .cse0) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv0 8) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)))) .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (let ((.cse12 ((_ sign_extend 16) (_ bv16 16))) (.cse14 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse12)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse12) .cse2 .cse10 .cse11 (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse13)) .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse14) .cse6 (= ((_ sign_extend 24) (_ bv255 8)) .cse15) (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse14)))))))) [2023-12-24 17:16:52,277 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-12-24 17:16:52,277 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 17:16:52,277 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))))) (let ((.cse1 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32))) (.cse8 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse3 (bvsle .cse10 (_ bv1 32))) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse9 (bvsge .cse10 (_ bv1 32)))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv16 16))) (.cse6 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse0)) .cse1 (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse0) .cse2 .cse3 .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse6) .cse7 (= ((_ sign_extend 24) (_ bv255 8)) .cse8) .cse9 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse6)))) (and .cse1 (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse8)))) .cse2 .cse3 .cse4 .cse5 .cse7 .cse9)))) [2023-12-24 17:16:52,277 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-24 17:16:52,277 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 75) no Hoare annotation was computed. [2023-12-24 17:16:52,277 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))))) (let ((.cse0 ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (.cse8 (= .cse16 (_ bv1 32))) (.cse13 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) (.cse15 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse1 (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse15))))) (.cse3 (bvsle .cse17 (_ bv1 32))) (.cse7 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse13)) (.cse9 (bvsge .cse17 (_ bv1 32))) (.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse10 (= .cse16 (_ bv0 32))) (.cse11 (or (= .cse0 (_ bv0 8)) .cse8)) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|))) (or (and (bvsle ((_ zero_extend 24) .cse0) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv0 8) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)))) .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (let ((.cse12 ((_ sign_extend 16) (_ bv16 16))) (.cse14 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse12)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse12) .cse2 .cse10 .cse11 (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse13)) .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse14) .cse6 (= ((_ sign_extend 24) (_ bv255 8)) .cse15) (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse14)))))))) [2023-12-24 17:16:52,277 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L899 garLoopResultBuilder]: For program point L64-2(lines 64 74) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))))) (let ((.cse0 ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (.cse8 (= .cse16 (_ bv1 32))) (.cse13 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) (.cse15 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse1 (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse15))))) (.cse3 (bvsle .cse17 (_ bv1 32))) (.cse7 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse13)) (.cse9 (bvsge .cse17 (_ bv1 32))) (.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse10 (= .cse16 (_ bv0 32))) (.cse11 (or (= .cse0 (_ bv0 8)) .cse8)) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|))) (or (and (bvsle ((_ zero_extend 24) .cse0) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (_ bv0 8) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)))) .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (let ((.cse12 ((_ sign_extend 16) (_ bv16 16))) (.cse14 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse12)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse12) .cse2 .cse10 .cse11 (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse13)) .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse14) .cse6 (= ((_ sign_extend 24) (_ bv255 8)) .cse15) (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse14)))))))) [2023-12-24 17:16:52,278 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 73) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 70) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse9 ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (.cse8 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse1 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (= ((_ extract 7 0) (select (select |#memory_int#3| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) |ULTIMATE.start_updateVariables_#t~mem41#1|)) (.cse7 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse2 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv16 16))) (.cse6 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse0)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse0) .cse1 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse2)) .cse3 .cse4 .cse5 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse6) .cse7 (= ((_ sign_extend 24) (_ bv255 8)) .cse8) (= .cse9 (_ bv0 8)) (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse6)))) (and (bvsle ((_ zero_extend 24) .cse9) (_ bv0 32)) (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse8)))) .cse1 .cse3 .cse4 .cse5 .cse7 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse2)))) [2023-12-24 17:16:52,278 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 76) no Hoare annotation was computed. [2023-12-24 17:16:52,278 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse11 ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) (let ((.cse2 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse6 ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#8| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse1 (select (select |#memory_int#6| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) (.cse0 ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (.cse7 (bvsge ((_ zero_extend 24) .cse11) (_ bv1 32))) (.cse8 (= .cse11 |ULTIMATE.start_updateVariables_#t~mem42#1|))) (or (and (bvsle ((_ zero_extend 24) .cse0) (_ bv0 32)) (= (select (select |#memory_int#11| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) .cse1)))) .cse2 .cse3 .cse4 .cse5 (= (select (select |#memory_int#10| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset) .cse6) .cse7 .cse8) (let ((.cse9 ((_ sign_extend 16) (_ bv16 16))) (.cse10 ((_ sign_extend 16) (_ bv25 16)))) (and (= ~last_1_var_1_14~0 ((_ extract 15 0) .cse9)) (= (select (select |#memory_int#11| |~#var_1_14~0.base|) |~#var_1_14~0.offset|) .cse9) .cse2 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967292 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)))) .cse6)) .cse3 .cse4 (= (select (select |#memory_int#12| |~#var_1_15~0.base|) |~#var_1_15~0.offset|) .cse10) .cse5 (= ((_ sign_extend 24) (_ bv255 8)) .cse1) (= .cse0 (_ bv0 8)) .cse7 .cse8 (= ~last_1_var_1_15~0 ((_ extract 15 0) .cse10))))))) [2023-12-24 17:16:52,279 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 17:16:52,281 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] [2023-12-24 17:16:52,284 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 17:16:52,300 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~#var_1_14~0!base][~#var_1_14~0!offset] could not be translated [2023-12-24 17:16:52,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~#var_1_15~0!base][~#var_1_15~0!offset] could not be translated [2023-12-24 17:16:52,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,301 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,302 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,303 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,304 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,304 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,304 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 17:16:52,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 05:16:52 BoogieIcfgContainer [2023-12-24 17:16:52,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 17:16:52,305 INFO L158 Benchmark]: Toolchain (without parser) took 69888.75ms. Allocated memory was 229.6MB in the beginning and 574.6MB in the end (delta: 345.0MB). Free memory was 175.9MB in the beginning and 380.6MB in the end (delta: -204.7MB). Peak memory consumption was 336.3MB. Max. memory is 8.0GB. [2023-12-24 17:16:52,305 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 190.8MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 17:16:52,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.16ms. Allocated memory is still 229.6MB. Free memory was 175.9MB in the beginning and 161.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 17:16:52,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.96ms. Allocated memory is still 229.6MB. Free memory was 161.1MB in the beginning and 158.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 17:16:52,309 INFO L158 Benchmark]: Boogie Preprocessor took 71.68ms. Allocated memory is still 229.6MB. Free memory was 158.1MB in the beginning and 152.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 17:16:52,309 INFO L158 Benchmark]: RCFGBuilder took 824.00ms. Allocated memory is still 229.6MB. Free memory was 152.3MB in the beginning and 178.6MB in the end (delta: -26.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-24 17:16:52,309 INFO L158 Benchmark]: TraceAbstraction took 68684.81ms. Allocated memory was 229.6MB in the beginning and 574.6MB in the end (delta: 345.0MB). Free memory was 178.1MB in the beginning and 380.6MB in the end (delta: -202.6MB). Peak memory consumption was 337.5MB. Max. memory is 8.0GB. [2023-12-24 17:16:52,316 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.49ms. Allocated memory is still 190.8MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.16ms. Allocated memory is still 229.6MB. Free memory was 175.9MB in the beginning and 161.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.96ms. Allocated memory is still 229.6MB. Free memory was 161.1MB in the beginning and 158.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.68ms. Allocated memory is still 229.6MB. Free memory was 158.1MB in the beginning and 152.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 824.00ms. Allocated memory is still 229.6MB. Free memory was 152.3MB in the beginning and 178.6MB in the end (delta: -26.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 68684.81ms. Allocated memory was 229.6MB in the beginning and 574.6MB in the end (delta: 345.0MB). Free memory was 178.1MB in the beginning and 380.6MB in the end (delta: -202.6MB). Peak memory consumption was 337.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~#var_1_14~0!base][~#var_1_14~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~#var_1_15~0!base][~#var_1_15~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_14_Pointer~0!base][~var_1_14_Pointer~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, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.6s, OverallIterations: 27, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3969 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3965 mSDsluCounter, 14217 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10835 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3277 IncrementalHoareTripleChecker+Invalid, 3674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 3382 mSDtfsCounter, 3277 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6798 GetRequests, 6403 SyntacticMatches, 5 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=593occurred in iteration=26, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 1028 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 758 PreInvPairs, 844 NumberOfFragments, 2626 HoareAnnotationTreeSize, 758 FormulaSimplifications, 285459 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 15 FormulaSimplificationsInter, 167533 FormulaSimplificationTreeSizeReductionInter, 10.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 4301 NumberOfCodeBlocks, 4301 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6393 ConstructedInterpolants, 433 QuantifiedInterpolants, 47936 SizeOfPredicates, 332 NumberOfNonLiveVariables, 10627 ConjunctsInSsa, 352 ConjunctsInUnsatCore, 44 InterpolantComputations, 22 PerfectInterpolantSequences, 24852/30376 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: 109]: Loop Invariant Derived loop invariant: ((((((((last_1_var_1_14 == (16 & 32767)) && ((null & 127) <= 0)) && ((null & 127) == 0)) && !((((-4 + (null & 127)) % 4294967296) < (null & 127)))) && !((((null & 32767) / (null & 127)) >= (null & 32767)))) && (last_1_var_1_15 == (25 & 32767))) || (((((((null & 127) <= 0) && ((0 == (null & 127)) || ((null & 127) == 1))) && ((null & 127) <= 1)) && ((null & 32767) == (null & 127))) && ((null & 127) >= 1)) && (((null & 127) == 0) || !((0 == (null & 127)))))) || (((((((null & 127) <= 0) && ((null & 127) == 0)) && ((null & 127) <= 1)) && ((null & 32767) == (null & 127))) && ((null & 127) >= 1)) && !((((null & 32767) / (null & 127)) >= (null & 32767))))) RESULT: Ultimate proved your program to be correct! [2023-12-24 17:16:52,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...