/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-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 15:50:05,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 15:50:05,133 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-16 15:50:05,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 15:50:05,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 15:50:05,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 15:50:05,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 15:50:05,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 15:50:05,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 15:50:05,151 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 15:50:05,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 15:50:05,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 15:50:05,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 15:50:05,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 15:50:05,152 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 15:50:05,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 15:50:05,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 15:50:05,153 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 15:50:05,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 15:50:05,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 15:50:05,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 15:50:05,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 15:50:05,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 15:50:05,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 15:50:05,157 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 15:50:05,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 15:50:05,157 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 15:50:05,157 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 15:50:05,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 15:50:05,158 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 15:50:05,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 15:50:05,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 15:50:05,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 15:50:05,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 15:50:05,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:50:05,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 15:50:05,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 15:50:05,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 15:50:05,159 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 15:50:05,159 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:05,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 15:50:05,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 15:50:05,160 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 15:50:05,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 15:50:05,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 15:50:05,161 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 15:50:05,161 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-16 15:50:05,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 15:50:05,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 15:50:05,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 15:50:05,370 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 15:50:05,371 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 15:50:05,372 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-62.i [2023-12-16 15:50:06,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 15:50:06,649 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 15:50:06,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2023-12-16 15:50:06,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7c7b337/9c6d3a44c20e41158fda213fe91ec0e2/FLAG67f1e6c60 [2023-12-16 15:50:06,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7c7b337/9c6d3a44c20e41158fda213fe91ec0e2 [2023-12-16 15:50:06,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 15:50:06,675 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 15:50:06,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 15:50:06,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 15:50:06,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 15:50:06,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:06,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c86634a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06, skipping insertion in model container [2023-12-16 15:50:06,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:06,709 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 15:50:06,801 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-62.i[916,929] [2023-12-16 15:50:06,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:50:06,853 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 15:50:06,870 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-62.i[916,929] [2023-12-16 15:50:06,903 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:50:06,919 INFO L206 MainTranslator]: Completed translation [2023-12-16 15:50:06,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06 WrapperNode [2023-12-16 15:50:06,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 15:50:06,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 15:50:06,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 15:50:06,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 15:50:06,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:06,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:06,987 INFO L138 Inliner]: procedures = 33, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 348 [2023-12-16 15:50:06,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 15:50:06,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 15:50:06,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 15:50:06,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 15:50:07,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,025 INFO L175 MemorySlicer]: Split 87 memory accesses to 11 slices as follows [2, 6, 5, 10, 18, 4, 12, 11, 10, 5, 4]. 21 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1]. [2023-12-16 15:50:07,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 15:50:07,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 15:50:07,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 15:50:07,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 15:50:07,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (1/1) ... [2023-12-16 15:50:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:50:07,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 15:50:07,140 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-16 15:50:07,178 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-16 15:50:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 15:50:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 15:50:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 15:50:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 15:50:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-16 15:50:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-16 15:50:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-16 15:50:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-16 15:50:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-16 15:50:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-16 15:50:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-12-16 15:50:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2023-12-16 15:50:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2023-12-16 15:50:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2023-12-16 15:50:07,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2023-12-16 15:50:07,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 15:50:07,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 15:50:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 15:50:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 15:50:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-16 15:50:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-16 15:50:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-16 15:50:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-16 15:50:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-16 15:50:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-16 15:50:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-16 15:50:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 15:50:07,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 15:50:07,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 15:50:07,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 15:50:07,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 15:50:07,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 15:50:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-16 15:50:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-16 15:50:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-16 15:50:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-16 15:50:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-16 15:50:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-16 15:50:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-16 15:50:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-16 15:50:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-16 15:50:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-16 15:50:07,376 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 15:50:07,377 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 15:50:07,672 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 15:50:07,715 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 15:50:07,715 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 15:50:07,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:50:07 BoogieIcfgContainer [2023-12-16 15:50:07,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 15:50:07,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 15:50:07,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 15:50:07,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 15:50:07,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:50:06" (1/3) ... [2023-12-16 15:50:07,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0f9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:50:07, skipping insertion in model container [2023-12-16 15:50:07,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:06" (2/3) ... [2023-12-16 15:50:07,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0f9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:50:07, skipping insertion in model container [2023-12-16 15:50:07,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:50:07" (3/3) ... [2023-12-16 15:50:07,724 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-62.i [2023-12-16 15:50:07,736 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 15:50:07,736 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 15:50:07,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 15:50:07,782 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;@f3fc0c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 15:50:07,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 15:50:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 15:50:07,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:07,798 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:07,798 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:07,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash -710106841, now seen corresponding path program 1 times [2023-12-16 15:50:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:07,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954530743] [2023-12-16 15:50:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:07,817 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-16 15:50:07,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:07,819 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-16 15:50:07,842 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-16 15:50:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:08,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 15:50:08,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-16 15:50:08,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:08,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954530743] [2023-12-16 15:50:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954530743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:08,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 15:50:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553465821] [2023-12-16 15:50:08,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:08,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 15:50:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:08,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 15:50:08,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:50:08,181 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 15:50:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:08,215 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-12-16 15:50:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 15:50:08,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-12-16 15:50:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:08,222 INFO L225 Difference]: With dead ends: 129 [2023-12-16 15:50:08,222 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 15:50:08,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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-16 15:50:08,226 INFO L413 NwaCegarLoop]: 88 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, 88 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-16 15:50:08,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 15:50:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-16 15:50:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-12-16 15:50:08,253 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-12-16 15:50:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:08,253 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-12-16 15:50:08,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 15:50:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-12-16 15:50:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 15:50:08,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:08,256 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:08,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:08,462 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-16 15:50:08,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:08,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash -770566889, now seen corresponding path program 1 times [2023-12-16 15:50:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611699028] [2023-12-16 15:50:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:08,464 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-16 15:50:08,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:08,465 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-16 15:50:08,494 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-16 15:50:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:08,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 15:50:08,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:08,645 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-16 15:50:08,677 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 34 treesize of output 22 [2023-12-16 15:50:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:08,694 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:08,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611699028] [2023-12-16 15:50:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611699028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:08,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:08,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:50:08,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935670393] [2023-12-16 15:50:08,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:08,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:50:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:50:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:50:08,697 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:08,778 INFO L93 Difference]: Finished difference Result 152 states and 218 transitions. [2023-12-16 15:50:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 15:50:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-16 15:50:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:08,781 INFO L225 Difference]: With dead ends: 152 [2023-12-16 15:50:08,781 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 15:50:08,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-16 15:50:08,782 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 92 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:08,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 255 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 15:50:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2023-12-16 15:50:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2023-12-16 15:50:08,788 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 68 [2023-12-16 15:50:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:08,789 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2023-12-16 15:50:08,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2023-12-16 15:50:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-16 15:50:08,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:08,791 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:08,797 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-16 15:50:08,991 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-16 15:50:08,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:08,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:08,992 INFO L85 PathProgramCache]: Analyzing trace with hash -694795588, now seen corresponding path program 1 times [2023-12-16 15:50:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:08,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90384168] [2023-12-16 15:50:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:08,996 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-16 15:50:08,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:08,997 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-16 15:50:08,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 (4)] Waiting until timeout for monitored process [2023-12-16 15:50:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:09,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 15:50:09,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:09,191 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-16 15:50:09,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 37 treesize of output 25 [2023-12-16 15:50:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:09,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:09,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:09,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90384168] [2023-12-16 15:50:09,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90384168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:09,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:09,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:50:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492298871] [2023-12-16 15:50:09,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:09,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:50:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:09,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:50:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:50:09,269 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:09,412 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2023-12-16 15:50:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 15:50:09,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-12-16 15:50:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:09,419 INFO L225 Difference]: With dead ends: 212 [2023-12-16 15:50:09,419 INFO L226 Difference]: Without dead ends: 149 [2023-12-16 15:50:09,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 15:50:09,420 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 201 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:09,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 650 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-16 15:50:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 74. [2023-12-16 15:50:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2023-12-16 15:50:09,433 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 70 [2023-12-16 15:50:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:09,433 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2023-12-16 15:50:09,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2023-12-16 15:50:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 15:50:09,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:09,435 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:09,438 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-16 15:50:09,636 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-16 15:50:09,636 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:09,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1968798550, now seen corresponding path program 1 times [2023-12-16 15:50:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:09,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850526839] [2023-12-16 15:50:09,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:09,637 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-16 15:50:09,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:09,639 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-16 15:50:09,641 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-16 15:50:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:09,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 15:50:09,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:10,062 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 15 treesize of output 7 [2023-12-16 15:50:10,066 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 10 [2023-12-16 15:50:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:10,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:10,158 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-16 15:50:10,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850526839] [2023-12-16 15:50:10,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850526839] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1487348598] [2023-12-16 15:50:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:50:10,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:50:10,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-16 15:50:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:10,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:50:10,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:10,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1487348598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-16 15:50:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821821116] [2023-12-16 15:50:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:10,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:10,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-16 15:50:10,476 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:10,542 INFO L93 Difference]: Finished difference Result 162 states and 230 transitions. [2023-12-16 15:50:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 15:50:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-16 15:50:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:10,544 INFO L225 Difference]: With dead ends: 162 [2023-12-16 15:50:10,544 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 15:50:10,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-12-16 15:50:10,545 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 28 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:10,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 323 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 15:50:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2023-12-16 15:50:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-12-16 15:50:10,550 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 72 [2023-12-16 15:50:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:10,550 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-12-16 15:50:10,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2023-12-16 15:50:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 15:50:10,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:10,552 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:10,571 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-16 15:50:10,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:10,961 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:10,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:10,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:10,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2026056852, now seen corresponding path program 1 times [2023-12-16 15:50:10,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:10,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43874717] [2023-12-16 15:50:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:10,980 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-16 15:50:10,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:10,981 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-16 15:50:10,992 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-16 15:50:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:11,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 15:50:11,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:11,343 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 15 treesize of output 7 [2023-12-16 15:50:11,346 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 10 [2023-12-16 15:50:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:11,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:11,422 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-16 15:50:11,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43874717] [2023-12-16 15:50:11,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43874717] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [452655172] [2023-12-16 15:50:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:11,470 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:11,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:50:11,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:50:11,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-16 15:50:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:11,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 15:50:11,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:11,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:11,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [452655172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:11,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:11,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-16 15:50:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375258238] [2023-12-16 15:50:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:11,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:50:11,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:50:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-16 15:50:11,712 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:11,817 INFO L93 Difference]: Finished difference Result 167 states and 232 transitions. [2023-12-16 15:50:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 15:50:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-16 15:50:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:11,818 INFO L225 Difference]: With dead ends: 167 [2023-12-16 15:50:11,818 INFO L226 Difference]: Without dead ends: 90 [2023-12-16 15:50:11,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2023-12-16 15:50:11,820 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 22 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:11,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 398 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-16 15:50:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2023-12-16 15:50:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2023-12-16 15:50:11,824 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 72 [2023-12-16 15:50:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:11,824 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2023-12-16 15:50:11,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2023-12-16 15:50:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 15:50:11,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:11,825 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:11,829 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-16 15:50:12,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:12,229 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:12,230 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:12,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2026116434, now seen corresponding path program 1 times [2023-12-16 15:50:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:12,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852730558] [2023-12-16 15:50:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:12,230 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-16 15:50:12,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:12,251 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-16 15:50:12,255 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-16 15:50:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:12,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 15:50:12,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:12,634 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 15 treesize of output 7 [2023-12-16 15:50:12,637 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 10 [2023-12-16 15:50:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:12,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:12,715 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-16 15:50:12,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852730558] [2023-12-16 15:50:12,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852730558] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1813864678] [2023-12-16 15:50:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:12,764 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:50:12,777 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:50:12,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-16 15:50:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:12,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:50:12,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:13,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1813864678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-16 15:50:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248854852] [2023-12-16 15:50:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:13,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:13,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-16 15:50:13,020 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:13,103 INFO L93 Difference]: Finished difference Result 217 states and 299 transitions. [2023-12-16 15:50:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:50:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-16 15:50:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:13,105 INFO L225 Difference]: With dead ends: 217 [2023-12-16 15:50:13,105 INFO L226 Difference]: Without dead ends: 138 [2023-12-16 15:50:13,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-12-16 15:50:13,106 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:13,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 495 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-16 15:50:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 80. [2023-12-16 15:50:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2023-12-16 15:50:13,110 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 72 [2023-12-16 15:50:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:13,111 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2023-12-16 15:50:13,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2023-12-16 15:50:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 15:50:13,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:13,112 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:13,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:13,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-16 15:50:13,516 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:13,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:13,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash -22400883, now seen corresponding path program 1 times [2023-12-16 15:50:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:13,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164653294] [2023-12-16 15:50:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:13,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:13,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:13,518 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-16 15:50:13,519 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-16 15:50:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:13,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:50:13,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:13,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:13,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164653294] [2023-12-16 15:50:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164653294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054664145] [2023-12-16 15:50:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:13,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:13,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:50:13,714 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:13,758 INFO L93 Difference]: Finished difference Result 175 states and 241 transitions. [2023-12-16 15:50:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:50:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-16 15:50:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:13,759 INFO L225 Difference]: With dead ends: 175 [2023-12-16 15:50:13,759 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 15:50:13,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 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-16 15:50:13,760 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:13,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 15:50:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2023-12-16 15:50:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2023-12-16 15:50:13,764 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 72 [2023-12-16 15:50:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:13,764 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2023-12-16 15:50:13,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2023-12-16 15:50:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 15:50:13,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:13,765 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:13,771 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-16 15:50:13,969 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-16 15:50:13,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:13,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:13,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1221843874, now seen corresponding path program 1 times [2023-12-16 15:50:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939586992] [2023-12-16 15:50:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:13,970 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-16 15:50:13,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:13,971 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-16 15:50:14,006 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-16 15:50:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:14,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:50:14,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:14,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 15 [2023-12-16 15:50:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:14,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:14,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:14,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939586992] [2023-12-16 15:50:14,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939586992] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:14,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:14,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-16 15:50:14,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703396010] [2023-12-16 15:50:14,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:14,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:14,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-16 15:50:14,380 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:14,430 INFO L93 Difference]: Finished difference Result 196 states and 265 transitions. [2023-12-16 15:50:14,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:50:14,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-16 15:50:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:14,432 INFO L225 Difference]: With dead ends: 196 [2023-12-16 15:50:14,432 INFO L226 Difference]: Without dead ends: 114 [2023-12-16 15:50:14,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:50:14,433 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 115 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:14,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 249 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-16 15:50:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2023-12-16 15:50:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 15:50:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2023-12-16 15:50:14,437 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 72 [2023-12-16 15:50:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:14,437 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2023-12-16 15:50:14,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2023-12-16 15:50:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 15:50:14,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:14,438 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:14,444 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-16 15:50:14,644 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-16 15:50:14,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:14,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1308385672, now seen corresponding path program 1 times [2023-12-16 15:50:14,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:14,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306216110] [2023-12-16 15:50:14,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:14,645 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-16 15:50:14,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:14,646 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-16 15:50:14,654 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-16 15:50:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:14,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 15:50:14,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:15,027 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 15 treesize of output 7 [2023-12-16 15:50:15,030 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 10 [2023-12-16 15:50:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:15,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:15,108 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-16 15:50:15,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:15,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306216110] [2023-12-16 15:50:15,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306216110] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:15,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1783243574] [2023-12-16 15:50:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:15,148 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:50:15,149 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:50:15,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-16 15:50:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:15,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 15:50:15,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:15,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:50:15,883 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 10 [2023-12-16 15:50:15,887 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 15 treesize of output 7 [2023-12-16 15:50:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:15,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:15,916 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-16 15:50:15,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1783243574] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:15,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:50:15,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-16 15:50:15,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186596479] [2023-12-16 15:50:15,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:50:15,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 15:50:15,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:15,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 15:50:15,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-12-16 15:50:15,964 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-16 15:50:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:16,789 INFO L93 Difference]: Finished difference Result 227 states and 299 transitions. [2023-12-16 15:50:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 15:50:16,790 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 74 [2023-12-16 15:50:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:16,790 INFO L225 Difference]: With dead ends: 227 [2023-12-16 15:50:16,791 INFO L226 Difference]: Without dead ends: 145 [2023-12-16 15:50:16,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 15:50:16,792 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 198 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:16,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 908 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 15:50:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-16 15:50:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2023-12-16 15:50:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 125 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 15:50:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2023-12-16 15:50:16,798 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 74 [2023-12-16 15:50:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:16,798 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2023-12-16 15:50:16,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-16 15:50:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2023-12-16 15:50:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 15:50:16,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:16,799 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:16,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-12-16 15:50:17,005 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 (13)] Ended with exit code 0 [2023-12-16 15:50:17,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:17,203 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:17,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -885683846, now seen corresponding path program 1 times [2023-12-16 15:50:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200443147] [2023-12-16 15:50:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:17,204 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-16 15:50:17,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:17,205 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-16 15:50:17,209 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-16 15:50:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:17,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:50:17,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:17,359 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-16 15:50:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:17,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:17,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:17,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200443147] [2023-12-16 15:50:17,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200443147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:17,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:17,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:17,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324228354] [2023-12-16 15:50:17,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:17,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:17,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:17,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:17,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:50:17,411 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:17,644 INFO L93 Difference]: Finished difference Result 346 states and 452 transitions. [2023-12-16 15:50:17,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:50:17,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-16 15:50:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:17,647 INFO L225 Difference]: With dead ends: 346 [2023-12-16 15:50:17,647 INFO L226 Difference]: Without dead ends: 209 [2023-12-16 15:50:17,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:17,647 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 120 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:17,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 417 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-16 15:50:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 132. [2023-12-16 15:50:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 119 states have internal predecessors, (153), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 15:50:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 173 transitions. [2023-12-16 15:50:17,653 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 173 transitions. Word has length 74 [2023-12-16 15:50:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:17,653 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 173 transitions. [2023-12-16 15:50:17,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 173 transitions. [2023-12-16 15:50:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 15:50:17,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:17,654 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:17,661 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 (15)] Ended with exit code 0 [2023-12-16 15:50:17,859 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-16 15:50:17,860 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:17,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1896801096, now seen corresponding path program 1 times [2023-12-16 15:50:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538693319] [2023-12-16 15:50:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:17,861 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-16 15:50:17,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:17,863 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-16 15:50:17,869 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-16 15:50:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:18,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 15:50:18,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:18,047 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-16 15:50:18,186 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-16 15:50:18,233 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-16 15:50:18,254 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-16 15:50:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-16 15:50:18,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:18,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538693319] [2023-12-16 15:50:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538693319] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:18,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:18,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 20 [2023-12-16 15:50:18,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027857583] [2023-12-16 15:50:18,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:18,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 15:50:18,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:18,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 15:50:18,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-12-16 15:50:18,432 INFO L87 Difference]: Start difference. First operand 132 states and 173 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:18,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:18,691 INFO L93 Difference]: Finished difference Result 306 states and 399 transitions. [2023-12-16 15:50:18,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 15:50:18,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-16 15:50:18,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:18,693 INFO L225 Difference]: With dead ends: 306 [2023-12-16 15:50:18,693 INFO L226 Difference]: Without dead ends: 175 [2023-12-16 15:50:18,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2023-12-16 15:50:18,694 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 190 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:18,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 784 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-16 15:50:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 136. [2023-12-16 15:50:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 123 states have internal predecessors, (157), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 15:50:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2023-12-16 15:50:18,699 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 177 transitions. Word has length 74 [2023-12-16 15:50:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:18,699 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 177 transitions. [2023-12-16 15:50:18,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 177 transitions. [2023-12-16 15:50:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 15:50:18,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:18,700 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:18,716 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-16 15:50:18,916 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-16 15:50:18,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:18,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash 253759711, now seen corresponding path program 1 times [2023-12-16 15:50:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:18,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766124240] [2023-12-16 15:50:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:18,917 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-16 15:50:18,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:18,918 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-16 15:50:18,934 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-16 15:50:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:19,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:50:19,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:19,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 15:50:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:19,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:19,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:19,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766124240] [2023-12-16 15:50:19,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766124240] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:19,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:19,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-16 15:50:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111349343] [2023-12-16 15:50:19,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:19,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:19,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:19,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:19,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-16 15:50:19,280 INFO L87 Difference]: Start difference. First operand 136 states and 177 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:19,330 INFO L93 Difference]: Finished difference Result 306 states and 398 transitions. [2023-12-16 15:50:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:50:19,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-16 15:50:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:19,331 INFO L225 Difference]: With dead ends: 306 [2023-12-16 15:50:19,332 INFO L226 Difference]: Without dead ends: 171 [2023-12-16 15:50:19,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:50:19,332 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 119 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:19,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 268 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-16 15:50:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2023-12-16 15:50:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.278688524590164) internal successors, (156), 123 states have internal predecessors, (156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 15:50:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 176 transitions. [2023-12-16 15:50:19,337 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 176 transitions. Word has length 74 [2023-12-16 15:50:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:19,338 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 176 transitions. [2023-12-16 15:50:19,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 176 transitions. [2023-12-16 15:50:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 15:50:19,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:19,338 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:19,344 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-16 15:50:19,542 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-16 15:50:19,542 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:19,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1700175206, now seen corresponding path program 1 times [2023-12-16 15:50:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:19,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123174982] [2023-12-16 15:50:19,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:19,543 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-16 15:50:19,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:19,544 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-16 15:50:19,546 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-16 15:50:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:19,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:50:19,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:19,830 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 15 treesize of output 7 [2023-12-16 15:50:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:19,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:19,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:19,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123174982] [2023-12-16 15:50:19,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123174982] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:19,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [44793824] [2023-12-16 15:50:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:19,897 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:19,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:50:19,897 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:50:19,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-16 15:50:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:20,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 15:50:20,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:20,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:50:20,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-12-16 15:50:20,676 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 29 treesize of output 17 [2023-12-16 15:50:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:20,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:20,806 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 21 treesize of output 13 [2023-12-16 15:50:20,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [44793824] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:20,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:50:20,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2023-12-16 15:50:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467556775] [2023-12-16 15:50:20,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:50:20,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 15:50:20,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:20,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 15:50:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2023-12-16 15:50:20,849 INFO L87 Difference]: Start difference. First operand 136 states and 176 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-16 15:50:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:21,492 INFO L93 Difference]: Finished difference Result 304 states and 388 transitions. [2023-12-16 15:50:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 15:50:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 74 [2023-12-16 15:50:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:21,493 INFO L225 Difference]: With dead ends: 304 [2023-12-16 15:50:21,493 INFO L226 Difference]: Without dead ends: 169 [2023-12-16 15:50:21,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1139, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 15:50:21,494 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 283 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:21,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 654 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 15:50:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-16 15:50:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2023-12-16 15:50:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 15:50:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2023-12-16 15:50:21,501 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 74 [2023-12-16 15:50:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:21,501 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2023-12-16 15:50:21,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-16 15:50:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2023-12-16 15:50:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 15:50:21,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:21,502 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:21,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:21,726 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-16 15:50:21,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 15:50:21,920 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:21,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1697474561, now seen corresponding path program 1 times [2023-12-16 15:50:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:21,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468913335] [2023-12-16 15:50:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:21,921 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-16 15:50:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:21,922 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-16 15:50:21,925 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-16 15:50:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:22,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 15:50:22,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:22,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-16 15:50:22,273 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 25 treesize of output 17 [2023-12-16 15:50:22,295 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-16 15:50:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 63 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-16 15:50:22,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:22,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468913335] [2023-12-16 15:50:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468913335] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:22,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:22,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2023-12-16 15:50:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414042737] [2023-12-16 15:50:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:22,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 15:50:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:22,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 15:50:22,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2023-12-16 15:50:22,493 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:22,797 INFO L93 Difference]: Finished difference Result 360 states and 460 transitions. [2023-12-16 15:50:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 15:50:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-16 15:50:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:22,800 INFO L225 Difference]: With dead ends: 360 [2023-12-16 15:50:22,800 INFO L226 Difference]: Without dead ends: 225 [2023-12-16 15:50:22,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-12-16 15:50:22,801 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 245 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:22,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 787 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:50:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-16 15:50:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2023-12-16 15:50:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 15:50:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2023-12-16 15:50:22,809 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 75 [2023-12-16 15:50:22,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:22,809 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2023-12-16 15:50:22,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2023-12-16 15:50:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 15:50:22,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:22,810 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:22,817 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 (20)] Ended with exit code 0 [2023-12-16 15:50:23,015 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 [2023-12-16 15:50:23,015 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:23,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1586375485, now seen corresponding path program 1 times [2023-12-16 15:50:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:23,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34405837] [2023-12-16 15:50:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:23,016 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-16 15:50:23,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:23,017 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:23,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-16 15:50:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:23,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:50:23,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:23,175 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 10 [2023-12-16 15:50:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:23,184 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:23,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34405837] [2023-12-16 15:50:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34405837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362421388] [2023-12-16 15:50:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:23,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:50:23,186 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:23,276 INFO L93 Difference]: Finished difference Result 328 states and 417 transitions. [2023-12-16 15:50:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:50:23,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-16 15:50:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:23,279 INFO L225 Difference]: With dead ends: 328 [2023-12-16 15:50:23,279 INFO L226 Difference]: Without dead ends: 193 [2023-12-16 15:50:23,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:23,280 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 84 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:23,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 370 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-16 15:50:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2023-12-16 15:50:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.234375) internal successors, (158), 130 states have internal predecessors, (158), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 15:50:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2023-12-16 15:50:23,287 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 75 [2023-12-16 15:50:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:23,287 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2023-12-16 15:50:23,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2023-12-16 15:50:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 15:50:23,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:23,288 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:23,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:23,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:23,492 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:23,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1071944993, now seen corresponding path program 1 times [2023-12-16 15:50:23,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:23,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808490080] [2023-12-16 15:50:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:23,493 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-16 15:50:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:23,494 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-16 15:50:23,495 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-16 15:50:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:23,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:50:23,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:23,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 15:50:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:23,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:23,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808490080] [2023-12-16 15:50:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808490080] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-16 15:50:23,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510580102] [2023-12-16 15:50:23,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:23,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-16 15:50:23,872 INFO L87 Difference]: Start difference. First operand 150 states and 190 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:23,926 INFO L93 Difference]: Finished difference Result 281 states and 356 transitions. [2023-12-16 15:50:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:50:23,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-12-16 15:50:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:23,927 INFO L225 Difference]: With dead ends: 281 [2023-12-16 15:50:23,927 INFO L226 Difference]: Without dead ends: 152 [2023-12-16 15:50:23,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:50:23,928 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:23,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 228 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-16 15:50:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2023-12-16 15:50:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.2265625) internal successors, (157), 130 states have internal predecessors, (157), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 15:50:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2023-12-16 15:50:23,934 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 75 [2023-12-16 15:50:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:23,935 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2023-12-16 15:50:23,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2023-12-16 15:50:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 15:50:23,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:23,935 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:23,954 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-16 15:50:24,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:24,136 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:24,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2088904177, now seen corresponding path program 1 times [2023-12-16 15:50:24,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:24,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812322487] [2023-12-16 15:50:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:24,137 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-16 15:50:24,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:24,139 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:24,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-16 15:50:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:24,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:50:24,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:24,433 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-16 15:50:24,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:50:24,457 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 15 treesize of output 7 [2023-12-16 15:50:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:24,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:24,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812322487] [2023-12-16 15:50:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812322487] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:24,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1995092657] [2023-12-16 15:50:24,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:24,566 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:50:24,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:50:24,569 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:50:24,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-12-16 15:50:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:24,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 15:50:24,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:25,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:50:25,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-12-16 15:50:25,380 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 29 treesize of output 17 [2023-12-16 15:50:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:25,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:25,487 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 21 treesize of output 13 [2023-12-16 15:50:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1995092657] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:25,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:50:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-12-16 15:50:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87115660] [2023-12-16 15:50:25,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:50:25,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 15:50:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:25,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 15:50:25,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2023-12-16 15:50:25,515 INFO L87 Difference]: Start difference. First operand 150 states and 189 transitions. Second operand has 19 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-16 15:50:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:26,578 INFO L93 Difference]: Finished difference Result 309 states and 388 transitions. [2023-12-16 15:50:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-16 15:50:26,578 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 76 [2023-12-16 15:50:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:26,579 INFO L225 Difference]: With dead ends: 309 [2023-12-16 15:50:26,579 INFO L226 Difference]: Without dead ends: 180 [2023-12-16 15:50:26,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=421, Invalid=1835, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 15:50:26,580 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 274 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:26,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 802 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 15:50:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-16 15:50:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 156. [2023-12-16 15:50:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.2076923076923076) internal successors, (157), 132 states have internal predecessors, (157), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 15:50:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2023-12-16 15:50:26,588 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 76 [2023-12-16 15:50:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:26,588 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2023-12-16 15:50:26,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-16 15:50:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2023-12-16 15:50:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-16 15:50:26,588 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:26,589 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:26,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:26,795 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 (23)] Ended with exit code 0 [2023-12-16 15:50:26,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:26,996 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:26,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1207142703, now seen corresponding path program 1 times [2023-12-16 15:50:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:26,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456474191] [2023-12-16 15:50:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:26,997 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-16 15:50:26,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:26,998 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-16 15:50:26,999 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-16 15:50:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:27,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 15:50:27,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:27,245 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-16 15:50:27,271 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-16 15:50:27,272 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 30 [2023-12-16 15:50:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-16 15:50:27,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:27,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456474191] [2023-12-16 15:50:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456474191] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:27,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2023-12-16 15:50:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694594668] [2023-12-16 15:50:27,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:27,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 15:50:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 15:50:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-16 15:50:27,375 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:27,616 INFO L93 Difference]: Finished difference Result 440 states and 553 transitions. [2023-12-16 15:50:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 15:50:27,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-16 15:50:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:27,621 INFO L225 Difference]: With dead ends: 440 [2023-12-16 15:50:27,621 INFO L226 Difference]: Without dead ends: 317 [2023-12-16 15:50:27,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2023-12-16 15:50:27,622 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 299 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:27,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 617 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-16 15:50:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 254. [2023-12-16 15:50:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 219 states have (on average 1.1917808219178083) internal successors, (261), 223 states have internal predecessors, (261), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 15:50:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 309 transitions. [2023-12-16 15:50:27,650 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 309 transitions. Word has length 78 [2023-12-16 15:50:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:27,650 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 309 transitions. [2023-12-16 15:50:27,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 309 transitions. [2023-12-16 15:50:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-16 15:50:27,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:27,651 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:27,655 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-16 15:50:27,855 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-16 15:50:27,855 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:27,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1425997421, now seen corresponding path program 1 times [2023-12-16 15:50:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916453271] [2023-12-16 15:50:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:27,856 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-16 15:50:27,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:27,857 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-16 15:50:27,858 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-16 15:50:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:28,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 15:50:28,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:28,025 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-16 15:50:28,097 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 20 [2023-12-16 15:50:28,098 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 21 treesize of output 13 [2023-12-16 15:50:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:28,116 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:28,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916453271] [2023-12-16 15:50:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916453271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:28,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:50:28,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881917620] [2023-12-16 15:50:28,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:28,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:50:28,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:28,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:50:28,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:50:28,118 INFO L87 Difference]: Start difference. First operand 254 states and 309 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:28,310 INFO L93 Difference]: Finished difference Result 536 states and 657 transitions. [2023-12-16 15:50:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:50:28,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-16 15:50:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:28,312 INFO L225 Difference]: With dead ends: 536 [2023-12-16 15:50:28,312 INFO L226 Difference]: Without dead ends: 319 [2023-12-16 15:50:28,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:28,313 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 163 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:28,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 514 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:50:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-16 15:50:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 237. [2023-12-16 15:50:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 204 states have (on average 1.1715686274509804) internal successors, (239), 207 states have internal predecessors, (239), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:50:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 283 transitions. [2023-12-16 15:50:28,324 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 283 transitions. Word has length 78 [2023-12-16 15:50:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:28,325 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 283 transitions. [2023-12-16 15:50:28,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 283 transitions. [2023-12-16 15:50:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-16 15:50:28,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:28,325 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:28,340 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-16 15:50:28,528 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-16 15:50:28,529 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:28,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2119412344, now seen corresponding path program 1 times [2023-12-16 15:50:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:28,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716962397] [2023-12-16 15:50:28,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:28,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-16 15:50:28,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:28,530 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-16 15:50:28,531 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-16 15:50:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:28,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 15:50:28,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:28,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-16 15:50:28,788 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 39 [2023-12-16 15:50:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:28,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:28,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:28,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716962397] [2023-12-16 15:50:28,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716962397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:28,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:28,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409759648] [2023-12-16 15:50:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:28,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:28,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:50:28,800 INFO L87 Difference]: Start difference. First operand 237 states and 283 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:28,888 INFO L93 Difference]: Finished difference Result 252 states and 303 transitions. [2023-12-16 15:50:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:50:28,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-12-16 15:50:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:28,890 INFO L225 Difference]: With dead ends: 252 [2023-12-16 15:50:28,890 INFO L226 Difference]: Without dead ends: 250 [2023-12-16 15:50:28,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:28,890 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 62 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:28,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 341 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-12-16 15:50:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2023-12-16 15:50:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 210 states have (on average 1.1666666666666667) internal successors, (245), 213 states have internal predecessors, (245), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:50:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 289 transitions. [2023-12-16 15:50:28,902 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 289 transitions. Word has length 80 [2023-12-16 15:50:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:28,902 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 289 transitions. [2023-12-16 15:50:28,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 289 transitions. [2023-12-16 15:50:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-16 15:50:28,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:28,903 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:28,924 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 (27)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:29,107 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-16 15:50:29,108 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:29,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:29,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2119352762, now seen corresponding path program 1 times [2023-12-16 15:50:29,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:29,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288908425] [2023-12-16 15:50:29,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:29,108 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-16 15:50:29,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:29,109 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-16 15:50:29,113 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-16 15:50:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:29,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 15:50:29,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:29,258 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-16 15:50:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:29,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:29,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288908425] [2023-12-16 15:50:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288908425] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:29,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67759715] [2023-12-16 15:50:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:29,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:29,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:29,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:29,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:50:29,307 INFO L87 Difference]: Start difference. First operand 243 states and 289 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:29,397 INFO L93 Difference]: Finished difference Result 453 states and 541 transitions. [2023-12-16 15:50:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:50:29,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-12-16 15:50:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:29,400 INFO L225 Difference]: With dead ends: 453 [2023-12-16 15:50:29,400 INFO L226 Difference]: Without dead ends: 247 [2023-12-16 15:50:29,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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-16 15:50:29,400 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 51 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:29,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 323 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-16 15:50:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2023-12-16 15:50:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 208 states have internal predecessors, (237), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:50:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 277 transitions. [2023-12-16 15:50:29,413 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 277 transitions. Word has length 80 [2023-12-16 15:50:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:29,413 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 277 transitions. [2023-12-16 15:50:29,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 277 transitions. [2023-12-16 15:50:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-16 15:50:29,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:29,414 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:29,418 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-16 15:50:29,618 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-16 15:50:29,618 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:29,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2062094460, now seen corresponding path program 1 times [2023-12-16 15:50:29,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:29,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108996064] [2023-12-16 15:50:29,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:29,619 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-16 15:50:29,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:29,620 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-16 15:50:29,620 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-16 15:50:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:29,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 15:50:29,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:29,888 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-16 15:50:30,277 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 27 treesize of output 23 [2023-12-16 15:50:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 15:50:30,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:30,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108996064] [2023-12-16 15:50:30,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108996064] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:30,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:30,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2023-12-16 15:50:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856884179] [2023-12-16 15:50:30,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:30,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:50:30,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:30,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:50:30,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-16 15:50:30,713 INFO L87 Difference]: Start difference. First operand 235 states and 277 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:30,947 INFO L93 Difference]: Finished difference Result 620 states and 732 transitions. [2023-12-16 15:50:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:50:30,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-12-16 15:50:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:30,963 INFO L225 Difference]: With dead ends: 620 [2023-12-16 15:50:30,963 INFO L226 Difference]: Without dead ends: 410 [2023-12-16 15:50:30,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-16 15:50:30,966 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:30,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 342 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-12-16 15:50:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 346. [2023-12-16 15:50:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 316 states have (on average 1.1550632911392404) internal successors, (365), 319 states have internal predecessors, (365), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:50:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 405 transitions. [2023-12-16 15:50:30,986 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 405 transitions. Word has length 80 [2023-12-16 15:50:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:30,986 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 405 transitions. [2023-12-16 15:50:30,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 405 transitions. [2023-12-16 15:50:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-16 15:50:30,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:30,987 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:30,991 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-16 15:50:31,191 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-16 15:50:31,191 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:31,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1186718059, now seen corresponding path program 1 times [2023-12-16 15:50:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106229972] [2023-12-16 15:50:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:31,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:31,193 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-16 15:50:31,200 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-16 15:50:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:31,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:50:31,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 15:50:31,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:31,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106229972] [2023-12-16 15:50:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106229972] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:31,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:31,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-16 15:50:31,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377083374] [2023-12-16 15:50:31,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:31,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:31,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:31,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:31,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:50:31,555 INFO L87 Difference]: Start difference. First operand 346 states and 405 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:31,634 INFO L93 Difference]: Finished difference Result 681 states and 795 transitions. [2023-12-16 15:50:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:50:31,635 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2023-12-16 15:50:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:31,650 INFO L225 Difference]: With dead ends: 681 [2023-12-16 15:50:31,650 INFO L226 Difference]: Without dead ends: 360 [2023-12-16 15:50:31,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-16 15:50:31,651 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:31,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 327 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-16 15:50:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 300. [2023-12-16 15:50:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 270 states have (on average 1.137037037037037) internal successors, (307), 273 states have internal predecessors, (307), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:50:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 347 transitions. [2023-12-16 15:50:31,666 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 347 transitions. Word has length 81 [2023-12-16 15:50:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:31,667 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 347 transitions. [2023-12-16 15:50:31,667 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 347 transitions. [2023-12-16 15:50:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 15:50:31,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:31,683 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:31,690 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-16 15:50:31,884 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-16 15:50:31,884 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:31,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash 846304127, now seen corresponding path program 1 times [2023-12-16 15:50:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807451225] [2023-12-16 15:50:31,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:31,885 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-16 15:50:31,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:31,886 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:31,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-16 15:50:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:32,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 15:50:32,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:32,047 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-16 15:50:32,170 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-16 15:50:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:32,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:32,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807451225] [2023-12-16 15:50:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807451225] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:32,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:32,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:50:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053906917] [2023-12-16 15:50:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:32,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:50:32,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:32,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:50:32,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:32,188 INFO L87 Difference]: Start difference. First operand 300 states and 347 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:32,678 INFO L93 Difference]: Finished difference Result 976 states and 1121 transitions. [2023-12-16 15:50:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 15:50:32,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2023-12-16 15:50:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:32,681 INFO L225 Difference]: With dead ends: 976 [2023-12-16 15:50:32,681 INFO L226 Difference]: Without dead ends: 701 [2023-12-16 15:50:32,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-12-16 15:50:32,682 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 291 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:32,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 430 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:50:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-12-16 15:50:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 527. [2023-12-16 15:50:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 485 states have (on average 1.1402061855670103) internal successors, (553), 488 states have internal predecessors, (553), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 609 transitions. [2023-12-16 15:50:32,718 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 609 transitions. Word has length 82 [2023-12-16 15:50:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:32,718 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 609 transitions. [2023-12-16 15:50:32,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 609 transitions. [2023-12-16 15:50:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-16 15:50:32,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:32,719 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:32,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:32,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:32,923 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:32,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash -548655890, now seen corresponding path program 1 times [2023-12-16 15:50:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:32,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117707730] [2023-12-16 15:50:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:32,924 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-16 15:50:32,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:32,925 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:32,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-16 15:50:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:33,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 15:50:33,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:33,079 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-16 15:50:33,143 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 21 treesize of output 13 [2023-12-16 15:50:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:33,156 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:33,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117707730] [2023-12-16 15:50:33,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117707730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:33,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:33,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:33,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519314003] [2023-12-16 15:50:33,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:33,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:50:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:50:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:50:33,158 INFO L87 Difference]: Start difference. First operand 527 states and 609 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:33,441 INFO L93 Difference]: Finished difference Result 1060 states and 1221 transitions. [2023-12-16 15:50:33,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:50:33,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2023-12-16 15:50:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:33,443 INFO L225 Difference]: With dead ends: 1060 [2023-12-16 15:50:33,443 INFO L226 Difference]: Without dead ends: 558 [2023-12-16 15:50:33,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 15:50:33,444 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 140 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:33,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 401 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:50:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-12-16 15:50:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 480. [2023-12-16 15:50:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 438 states have (on average 1.1324200913242009) internal successors, (496), 441 states have internal predecessors, (496), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 552 transitions. [2023-12-16 15:50:33,477 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 552 transitions. Word has length 82 [2023-12-16 15:50:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:33,478 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 552 transitions. [2023-12-16 15:50:33,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 552 transitions. [2023-12-16 15:50:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-16 15:50:33,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:33,479 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:33,496 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 (32)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:33,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:33,683 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:33,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash -818166341, now seen corresponding path program 1 times [2023-12-16 15:50:33,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:33,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032698639] [2023-12-16 15:50:33,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:33,683 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-16 15:50:33,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:33,684 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:33,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-16 15:50:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:33,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 15:50:33,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:33,927 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-16 15:50:34,315 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 27 treesize of output 23 [2023-12-16 15:50:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 15:50:34,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:34,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032698639] [2023-12-16 15:50:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032698639] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:34,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2023-12-16 15:50:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039560439] [2023-12-16 15:50:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:34,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:50:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:50:34,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-12-16 15:50:34,803 INFO L87 Difference]: Start difference. First operand 480 states and 552 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:35,139 INFO L93 Difference]: Finished difference Result 1028 states and 1184 transitions. [2023-12-16 15:50:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 15:50:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2023-12-16 15:50:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:35,141 INFO L225 Difference]: With dead ends: 1028 [2023-12-16 15:50:35,141 INFO L226 Difference]: Without dead ends: 573 [2023-12-16 15:50:35,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2023-12-16 15:50:35,142 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:35,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 405 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:50:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-12-16 15:50:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 487. [2023-12-16 15:50:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 445 states have (on average 1.1370786516853932) internal successors, (506), 448 states have internal predecessors, (506), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 562 transitions. [2023-12-16 15:50:35,162 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 562 transitions. Word has length 83 [2023-12-16 15:50:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:35,163 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 562 transitions. [2023-12-16 15:50:35,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 562 transitions. [2023-12-16 15:50:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 15:50:35,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:35,163 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:35,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:35,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:35,368 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:35,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash -39782315, now seen corresponding path program 1 times [2023-12-16 15:50:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013751817] [2023-12-16 15:50:35,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:35,369 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-16 15:50:35,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:35,381 INFO L229 MonitoredProcess]: Starting monitored process 34 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-16 15:50:35,382 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 (34)] Waiting until timeout for monitored process [2023-12-16 15:50:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:35,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 15:50:35,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:35,560 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-16 15:50:35,678 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-16 15:50:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 15:50:35,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:35,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:35,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013751817] [2023-12-16 15:50:35,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013751817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:35,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:35,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:50:35,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20236] [2023-12-16 15:50:35,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:35,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:50:35,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:35,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:50:35,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:35,715 INFO L87 Difference]: Start difference. First operand 487 states and 562 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:36,082 INFO L93 Difference]: Finished difference Result 1048 states and 1198 transitions. [2023-12-16 15:50:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 15:50:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2023-12-16 15:50:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:36,084 INFO L225 Difference]: With dead ends: 1048 [2023-12-16 15:50:36,084 INFO L226 Difference]: Without dead ends: 586 [2023-12-16 15:50:36,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:50:36,085 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 146 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:36,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 631 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 15:50:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-12-16 15:50:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 513. [2023-12-16 15:50:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 471 states have (on average 1.127388535031847) internal successors, (531), 474 states have internal predecessors, (531), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 587 transitions. [2023-12-16 15:50:36,118 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 587 transitions. Word has length 85 [2023-12-16 15:50:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:36,118 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 587 transitions. [2023-12-16 15:50:36,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 587 transitions. [2023-12-16 15:50:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-16 15:50:36,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:36,120 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 15:50:36,152 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 (34)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:36,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-16 15:50:36,322 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:36,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 767981285, now seen corresponding path program 1 times [2023-12-16 15:50:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:36,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566454968] [2023-12-16 15:50:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:36,323 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-16 15:50:36,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:36,324 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:36,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-16 15:50:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:36,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:50:36,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 32 proven. 287 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2023-12-16 15:50:36,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2023-12-16 15:50:36,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566454968] [2023-12-16 15:50:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566454968] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:36,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-16 15:50:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469457244] [2023-12-16 15:50:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:36,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:36,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:36,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:36,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:50:36,924 INFO L87 Difference]: Start difference. First operand 513 states and 587 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:37,001 INFO L93 Difference]: Finished difference Result 881 states and 1017 transitions. [2023-12-16 15:50:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:50:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2023-12-16 15:50:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:37,003 INFO L225 Difference]: With dead ends: 881 [2023-12-16 15:50:37,003 INFO L226 Difference]: Without dead ends: 600 [2023-12-16 15:50:37,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-16 15:50:37,004 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:37,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 382 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-12-16 15:50:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 515. [2023-12-16 15:50:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 473 states have (on average 1.1268498942917549) internal successors, (533), 476 states have internal predecessors, (533), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 589 transitions. [2023-12-16 15:50:37,049 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 589 transitions. Word has length 161 [2023-12-16 15:50:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:37,050 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 589 transitions. [2023-12-16 15:50:37,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 589 transitions. [2023-12-16 15:50:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-16 15:50:37,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:37,051 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 15:50:37,058 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 (35)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:37,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:37,251 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:37,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash 790613539, now seen corresponding path program 1 times [2023-12-16 15:50:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172119898] [2023-12-16 15:50:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:37,252 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-16 15:50:37,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:37,254 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:37,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-16 15:50:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:37,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:50:37,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:37,546 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-16 15:50:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-16 15:50:37,577 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:37,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172119898] [2023-12-16 15:50:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172119898] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:37,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060935716] [2023-12-16 15:50:37,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:37,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:50:37,579 INFO L87 Difference]: Start difference. First operand 515 states and 589 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:37,810 INFO L93 Difference]: Finished difference Result 1177 states and 1344 transitions. [2023-12-16 15:50:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:50:37,811 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2023-12-16 15:50:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:37,812 INFO L225 Difference]: With dead ends: 1177 [2023-12-16 15:50:37,812 INFO L226 Difference]: Without dead ends: 687 [2023-12-16 15:50:37,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:37,817 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 73 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:37,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 334 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:50:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-16 15:50:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 595. [2023-12-16 15:50:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 553 states have (on average 1.1121157323688968) internal successors, (615), 556 states have internal predecessors, (615), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 671 transitions. [2023-12-16 15:50:37,836 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 671 transitions. Word has length 161 [2023-12-16 15:50:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:37,836 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 671 transitions. [2023-12-16 15:50:37,836 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 671 transitions. [2023-12-16 15:50:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-16 15:50:37,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:37,838 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:50:37,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:38,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:38,043 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:38,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:38,043 INFO L85 PathProgramCache]: Analyzing trace with hash 61476176, now seen corresponding path program 1 times [2023-12-16 15:50:38,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:38,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362536744] [2023-12-16 15:50:38,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:38,044 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-16 15:50:38,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:38,045 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:38,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-16 15:50:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:38,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:50:38,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:38,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 15:50:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 13 proven. 306 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2023-12-16 15:50:38,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:50:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2023-12-16 15:50:38,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362536744] [2023-12-16 15:50:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362536744] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:50:38,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:50:38,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-16 15:50:38,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267594318] [2023-12-16 15:50:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:38,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:38,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-16 15:50:38,795 INFO L87 Difference]: Start difference. First operand 595 states and 671 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:38,863 INFO L93 Difference]: Finished difference Result 1060 states and 1197 transitions. [2023-12-16 15:50:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:50:38,863 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 163 [2023-12-16 15:50:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:38,865 INFO L225 Difference]: With dead ends: 1060 [2023-12-16 15:50:38,865 INFO L226 Difference]: Without dead ends: 697 [2023-12-16 15:50:38,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:50:38,866 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:38,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 311 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:50:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2023-12-16 15:50:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 613. [2023-12-16 15:50:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 571 states have (on average 1.1120840630472855) internal successors, (635), 574 states have internal predecessors, (635), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2023-12-16 15:50:38,884 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 163 [2023-12-16 15:50:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:38,885 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2023-12-16 15:50:38,885 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2023-12-16 15:50:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-16 15:50:38,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:38,887 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:50:38,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:39,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:39,092 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:39,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash 762540754, now seen corresponding path program 1 times [2023-12-16 15:50:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:39,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264585808] [2023-12-16 15:50:39,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:39,093 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-16 15:50:39,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:39,104 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:50:39,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-16 15:50:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:39,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:50:39,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:39,377 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-16 15:50:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-16 15:50:39,385 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:39,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:39,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264585808] [2023-12-16 15:50:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264585808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3768232] [2023-12-16 15:50:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:39,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:39,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:39,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:50:39,387 INFO L87 Difference]: Start difference. First operand 613 states and 691 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:39,692 INFO L93 Difference]: Finished difference Result 1030 states and 1162 transitions. [2023-12-16 15:50:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:50:39,692 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 163 [2023-12-16 15:50:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:39,694 INFO L225 Difference]: With dead ends: 1030 [2023-12-16 15:50:39,694 INFO L226 Difference]: Without dead ends: 649 [2023-12-16 15:50:39,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:39,694 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 58 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:39,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 248 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:50:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-12-16 15:50:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 574. [2023-12-16 15:50:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 532 states have (on average 1.1109022556390977) internal successors, (591), 535 states have internal predecessors, (591), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 647 transitions. [2023-12-16 15:50:39,711 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 647 transitions. Word has length 163 [2023-12-16 15:50:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:39,711 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 647 transitions. [2023-12-16 15:50:39,711 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 647 transitions. [2023-12-16 15:50:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-16 15:50:39,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:39,713 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 15:50:39,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:39,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:39,919 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:39,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2109556318, now seen corresponding path program 1 times [2023-12-16 15:50:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:39,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394687294] [2023-12-16 15:50:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:39,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:39,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:39,920 INFO L229 MonitoredProcess]: Starting monitored process 39 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-16 15:50:39,921 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 (39)] Waiting until timeout for monitored process [2023-12-16 15:50:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:40,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 15:50:40,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:40,200 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-16 15:50:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-16 15:50:40,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:40,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:40,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394687294] [2023-12-16 15:50:40,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394687294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:40,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:40,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:50:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529866181] [2023-12-16 15:50:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:40,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:50:40,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:40,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:50:40,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:50:40,221 INFO L87 Difference]: Start difference. First operand 574 states and 647 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:40,335 INFO L93 Difference]: Finished difference Result 858 states and 968 transitions. [2023-12-16 15:50:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 15:50:40,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 163 [2023-12-16 15:50:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:40,337 INFO L225 Difference]: With dead ends: 858 [2023-12-16 15:50:40,337 INFO L226 Difference]: Without dead ends: 482 [2023-12-16 15:50:40,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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-16 15:50:40,338 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 15 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:40,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-12-16 15:50:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2023-12-16 15:50:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 440 states have (on average 1.1022727272727273) internal successors, (485), 443 states have internal predecessors, (485), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:50:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 541 transitions. [2023-12-16 15:50:40,355 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 541 transitions. Word has length 163 [2023-12-16 15:50:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:40,355 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 541 transitions. [2023-12-16 15:50:40,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 541 transitions. [2023-12-16 15:50:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-16 15:50:40,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:50:40,357 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 15:50:40,361 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 (39)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:40,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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-16 15:50:40,561 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:50:40,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:50:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1336951680, now seen corresponding path program 1 times [2023-12-16 15:50:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:50:40,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329663133] [2023-12-16 15:50:40,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:50:40,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:50:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:50:40,563 INFO L229 MonitoredProcess]: Starting monitored process 40 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-16 15:50:40,592 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 (40)] Waiting until timeout for monitored process [2023-12-16 15:50:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:50:40,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:50:40,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:50:40,867 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-16 15:50:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-16 15:50:40,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:50:40,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:50:40,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329663133] [2023-12-16 15:50:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329663133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:50:40,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:50:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:50:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615294740] [2023-12-16 15:50:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:50:40,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:50:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:50:40,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:50:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:50:40,880 INFO L87 Difference]: Start difference. First operand 482 states and 541 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:50:41,016 INFO L93 Difference]: Finished difference Result 769 states and 857 transitions. [2023-12-16 15:50:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:50:41,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 164 [2023-12-16 15:50:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:50:41,017 INFO L225 Difference]: With dead ends: 769 [2023-12-16 15:50:41,017 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 15:50:41,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:50:41,018 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 45 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:50:41,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 291 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:50:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 15:50:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 15:50:41,019 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-16 15:50:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 15:50:41,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2023-12-16 15:50:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:50:41,019 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 15:50:41,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 15:50:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 15:50:41,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 15:50:41,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 15:50:41,029 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 (40)] Forceful destruction successful, exit code 0 [2023-12-16 15:50:41,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /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-16 15:50:41,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 15:50:48,630 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 15:50:48,630 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 15:50:48,630 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 15:50:48,630 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 15:50:48,631 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)))) (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) (= .cse7 .cse5) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) .cse3 .cse4 .cse6)))) [2023-12-16 15:50:48,631 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-16 15:50:48,631 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 15:50:48,631 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 15:50:48,631 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 15:50:48,631 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)))) (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) (= .cse7 .cse5) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) .cse3 .cse4 .cse6)))) [2023-12-16 15:50:48,631 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-16 15:50:48,631 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-12-16 15:50:48,631 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 15:50:48,631 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 77) no Hoare annotation was computed. [2023-12-16 15:50:48,632 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)))) (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) (= .cse7 .cse5) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) .cse3 .cse4 .cse6)))) [2023-12-16 15:50:48,632 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-16 15:50:48,632 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 78) no Hoare annotation was computed. [2023-12-16 15:50:48,632 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2023-12-16 15:50:48,632 INFO L895 garLoopResultBuilder]: At program point L105-2(lines 105 111) the Hoare annotation is: (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (not (= ((_ extract 7 0) (select (select |#memory_int#3| ~var_1_3_Pointer~0.base) ~var_1_3_Pointer~0.offset)) (_ bv0 8))) (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset))) (_ bv0 32)) .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (= .cse5 (select (select |#memory_int#8| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) .cse3 .cse4 .cse6))) [2023-12-16 15:50:48,632 INFO L899 garLoopResultBuilder]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2023-12-16 15:50:48,632 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse1 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse2 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse5 (bvsge (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) (_ bv1073741822 32)))) (or (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) .cse1 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (= .cse2 (select (select |#memory_int#8| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) .cse3 .cse4 .cse5) (let ((.cse6 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse6) ~last_1_var_1_5~0) .cse0 (= .cse6 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse1 (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset))) (_ bv0 32)) .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse2))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse5)))) [2023-12-16 15:50:48,632 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-16 15:50:48,632 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2023-12-16 15:50:48,632 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 69) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 69) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (and (= (_ bv0 32) |~#var_1_8~0.offset|) (= (_ bv0 32) ~var_1_8_Pointer~0.offset) (= (_ bv11 32) |~#var_1_8~0.base|) (= (_ bv11 32) ~var_1_8_Pointer~0.base) (= (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) |ULTIMATE.start_updateVariables_#t~mem35#1|)) [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse1 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse2 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse5 (bvsge (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) (_ bv1073741822 32)))) (or (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) .cse1 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) (= .cse2 (select (select |#memory_int#8| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)) .cse3 .cse4 .cse5) (let ((.cse6 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse6) ~last_1_var_1_5~0) .cse0 (= .cse6 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse1 (bvslt ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset))) (_ bv0 32)) .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse2))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse5)))) [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point L99-3(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point L99-5(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L899 garLoopResultBuilder]: For program point L99-6(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,633 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (= (_ bv0 32) |~#var_1_8~0.offset|) (= (_ bv0 32) ~var_1_8_Pointer~0.offset) (= (_ bv11 32) |~#var_1_8~0.base|) (= (_ bv11 32) ~var_1_8_Pointer~0.base) (bvsge (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)) (_ bv1073741822 32))) [2023-12-16 15:50:48,634 INFO L899 garLoopResultBuilder]: For program point L99-8(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,634 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-16 15:50:48,634 INFO L899 garLoopResultBuilder]: For program point L99-9(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,634 INFO L899 garLoopResultBuilder]: For program point L99-10(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,634 INFO L899 garLoopResultBuilder]: For program point L99-11(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,634 INFO L899 garLoopResultBuilder]: For program point L99-12(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,634 INFO L899 garLoopResultBuilder]: For program point L99-14(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,634 INFO L899 garLoopResultBuilder]: For program point L99-16(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,636 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 62) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L50-1(lines 50 62) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-18(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-20(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-21(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-22(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-23(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-25(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-27(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-28(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-30(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-32(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-33(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-35(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-36(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,637 INFO L899 garLoopResultBuilder]: For program point L99-38(line 99) no Hoare annotation was computed. [2023-12-16 15:50:48,638 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#8| (_ bv11 32)) (_ bv0 32)))) (let ((.cse1 (= (_ bv0 32) |~#var_1_8~0.offset|)) (.cse5 (select (select |#memory_int#9| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (.cse2 (= (_ bv0 32) ~var_1_8_Pointer~0.offset)) (.cse3 (= (_ bv11 32) |~#var_1_8~0.base|)) (.cse4 (= (_ bv11 32) ~var_1_8_Pointer~0.base)) (.cse6 (bvsge .cse7 (_ bv1073741822 32)))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv16 8)))) (and (= ((_ extract 7 0) .cse0) ~last_1_var_1_5~0) .cse1 (= .cse0 (select (select |#memory_int#5| |~#var_1_5~0.base|) |~#var_1_5~0.offset|)) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_step_#t~mem19#1_40| (_ BitVec 8))) (not (bvslt ((_ sign_extend 24) |v_ULTIMATE.start_step_#t~mem19#1_40|) .cse5))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)))) .cse6)) (and .cse1 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) (_ bv14 8))) (= .cse7 .cse5) .cse2 (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#7| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (select (select |#memory_int#10| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)) .cse3 .cse4 .cse6)))) [2023-12-16 15:50:48,638 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-16 15:50:48,638 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 59) no Hoare annotation was computed. [2023-12-16 15:50:48,638 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-16 15:50:48,638 INFO L899 garLoopResultBuilder]: For program point L68-2(line 68) no Hoare annotation was computed. [2023-12-16 15:50:48,640 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:50:48,642 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 15:50:48,651 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated [2023-12-16 15:50:48,652 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#var_1_5~0!base][~#var_1_5~0!offset] could not be translated [2023-12-16 15:50:48,652 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-12-16 15:50:48,652 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem19#1_40 : bv8 :: !~bvslt~32(~sign_extend~32~16(v_ULTIMATE.start_step_#t~mem19#1_40), #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset])) could not be translated [2023-12-16 15:50:48,652 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated [2023-12-16 15:50:48,652 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-16 15:50:48,652 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[11bv32][0bv32] could not be translated [2023-12-16 15:50:48,652 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-16 15:50:48,652 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-12-16 15:50:48,653 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-16 15:50:48,653 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-12-16 15:50:48,653 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-16 15:50:48,653 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[11bv32][0bv32] could not be translated [2023-12-16 15:50:48,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:50:48 BoogieIcfgContainer [2023-12-16 15:50:48,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 15:50:48,654 INFO L158 Benchmark]: Toolchain (without parser) took 41978.44ms. Allocated memory was 188.7MB in the beginning and 778.0MB in the end (delta: 589.3MB). Free memory was 148.1MB in the beginning and 312.6MB in the end (delta: -164.6MB). Peak memory consumption was 466.4MB. Max. memory is 8.0GB. [2023-12-16 15:50:48,654 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 15:50:48,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.12ms. Allocated memory is still 188.7MB. Free memory was 147.8MB in the beginning and 133.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 15:50:48,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.33ms. Allocated memory is still 188.7MB. Free memory was 133.4MB in the beginning and 131.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 15:50:48,654 INFO L158 Benchmark]: Boogie Preprocessor took 60.31ms. Allocated memory is still 188.7MB. Free memory was 131.0MB in the beginning and 126.1MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 15:50:48,654 INFO L158 Benchmark]: RCFGBuilder took 668.07ms. Allocated memory was 188.7MB in the beginning and 230.7MB in the end (delta: 41.9MB). Free memory was 126.1MB in the beginning and 190.3MB in the end (delta: -64.3MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2023-12-16 15:50:48,654 INFO L158 Benchmark]: TraceAbstraction took 40934.66ms. Allocated memory was 230.7MB in the beginning and 778.0MB in the end (delta: 547.4MB). Free memory was 189.8MB in the beginning and 312.6MB in the end (delta: -122.8MB). Peak memory consumption was 465.5MB. Max. memory is 8.0GB. [2023-12-16 15:50:48,655 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.11ms. Allocated memory is still 188.7MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.12ms. Allocated memory is still 188.7MB. Free memory was 147.8MB in the beginning and 133.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.33ms. Allocated memory is still 188.7MB. Free memory was 133.4MB in the beginning and 131.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.31ms. Allocated memory is still 188.7MB. Free memory was 131.0MB in the beginning and 126.1MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 668.07ms. Allocated memory was 188.7MB in the beginning and 230.7MB in the end (delta: 41.9MB). Free memory was 126.1MB in the beginning and 190.3MB in the end (delta: -64.3MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. * TraceAbstraction took 40934.66ms. Allocated memory was 230.7MB in the beginning and 778.0MB in the end (delta: 547.4MB). Free memory was 189.8MB in the beginning and 312.6MB in the end (delta: -122.8MB). Peak memory consumption was 465.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_3_Pointer~0!base][~var_1_3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#var_1_5~0!base][~#var_1_5~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_step_#t~mem19#1_40 : bv8 :: !~bvslt~32(~sign_extend~32~16(v_ULTIMATE.start_step_#t~mem19#1_40), #memory_int#9[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~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_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[11bv32][0bv32] 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_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~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_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[11bv32][0bv32] 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, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.9s, OverallIterations: 33, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3809 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3809 mSDsluCounter, 14086 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10764 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4014 IncrementalHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 3322 mSDtfsCounter, 4014 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4813 GetRequests, 4366 SyntacticMatches, 2 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=613occurred in iteration=30, InterpolantAutomatonStates: 289, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 1567 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 429 PreInvPairs, 466 NumberOfFragments, 824 HoareAnnotationTreeSize, 429 FormulaSimplifications, 3138853 FormulaSimplificationTreeSizeReduction, 4.7s HoareSimplificationTime, 10 FormulaSimplificationsInter, 94042 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 3461 NumberOfCodeBlocks, 3461 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4427 ConstructedInterpolants, 42 QuantifiedInterpolants, 22599 SizeOfPredicates, 379 NumberOfNonLiveVariables, 9910 ConjunctsInSsa, 385 ConjunctsInUnsatCore, 50 InterpolantComputations, 30 PerfectInterpolantSequences, 7339/8912 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: 105]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-16 15:50:48,684 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...