/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/seq-pthread/cs_peterson.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 11:35:37,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 11:35:38,022 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-25 11:35:38,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 11:35:38,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 11:35:38,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 11:35:38,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 11:35:38,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 11:35:38,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 11:35:38,043 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 11:35:38,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 11:35:38,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 11:35:38,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 11:35:38,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 11:35:38,050 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 11:35:38,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 11:35:38,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 11:35:38,052 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 11:35:38,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 11:35:38,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 11:35:38,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 11:35:38,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 11:35:38,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 11:35:38,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 11:35:38,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 11:35:38,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 11:35:38,053 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 11:35:38,054 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 11:35:38,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 11:35:38,054 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 11:35:38,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 11:35:38,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 11:35:38,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 11:35:38,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 11:35:38,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:35:38,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 11:35:38,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 11:35:38,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 11:35:38,056 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 11:35:38,056 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 11:35:38,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 11:35:38,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 11:35:38,056 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 11:35:38,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 11:35:38,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 11:35:38,057 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 11:35:38,057 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-25 11:35:38,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 11:35:38,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 11:35:38,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 11:35:38,226 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 11:35:38,226 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 11:35:38,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_peterson.i [2023-12-25 11:35:39,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 11:35:39,435 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 11:35:39,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_peterson.i [2023-12-25 11:35:39,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1a13e39/5aa036b05ced44fd9028a81cbc80b003/FLAG31f3e8476 [2023-12-25 11:35:39,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1a13e39/5aa036b05ced44fd9028a81cbc80b003 [2023-12-25 11:35:39,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 11:35:39,470 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 11:35:39,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 11:35:39,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 11:35:39,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 11:35:39,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:39,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11de4836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39, skipping insertion in model container [2023-12-25 11:35:39,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:39,525 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 11:35:39,720 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_peterson.i[23605,23618] [2023-12-25 11:35:39,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:35:39,825 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 11:35:39,848 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_peterson.i[23605,23618] [2023-12-25 11:35:39,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:35:39,915 INFO L206 MainTranslator]: Completed translation [2023-12-25 11:35:39,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39 WrapperNode [2023-12-25 11:35:39,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 11:35:39,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 11:35:39,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 11:35:39,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 11:35:39,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:39,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:39,966 INFO L138 Inliner]: procedures = 149, calls = 276, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 428 [2023-12-25 11:35:39,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 11:35:39,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 11:35:39,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 11:35:39,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 11:35:39,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:39,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:39,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:40,033 INFO L175 MemorySlicer]: Split 148 memory accesses to 17 slices as follows [2, 5, 8, 13, 8, 29, 21, 7, 7, 7, 7, 6, 5, 5, 5, 0, 13]. 20 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [2, 0, 3, 0, 3, 9, 9, 3, 3, 3, 3, 2, 0, 0, 0, 0, 0]. The 37 writes are split as follows [0, 1, 2, 1, 2, 11, 6, 2, 2, 2, 2, 2, 1, 1, 1, 0, 1]. [2023-12-25 11:35:40,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:40,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:40,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:40,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:40,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:40,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:40,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 11:35:40,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 11:35:40,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 11:35:40,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 11:35:40,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (1/1) ... [2023-12-25 11:35:40,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:35:40,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 11:35:40,133 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-25 11:35:40,151 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-25 11:35:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-25 11:35:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-25 11:35:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-25 11:35:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-25 11:35:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-25 11:35:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-25 11:35:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-25 11:35:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-25 11:35:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-25 11:35:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 11:35:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 11:35:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-25 11:35:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-25 11:35:40,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-25 11:35:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-25 11:35:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-25 11:35:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-25 11:35:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-25 11:35:40,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 11:35:40,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 11:35:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 11:35:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-25 11:35:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-25 11:35:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-25 11:35:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-25 11:35:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-25 11:35:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-25 11:35:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-25 11:35:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-25 11:35:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 11:35:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-25 11:35:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-25 11:35:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:35:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-25 11:35:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2023-12-25 11:35:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-25 11:35:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-25 11:35:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-12-25 11:35:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-25 11:35:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-25 11:35:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-25 11:35:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-25 11:35:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 11:35:40,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 11:35:40,399 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 11:35:40,401 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 11:35:45,763 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 11:35:45,812 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 11:35:45,813 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 11:35:45,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:35:45 BoogieIcfgContainer [2023-12-25 11:35:45,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 11:35:45,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 11:35:45,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 11:35:45,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 11:35:45,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 11:35:39" (1/3) ... [2023-12-25 11:35:45,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570badd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:35:45, skipping insertion in model container [2023-12-25 11:35:45,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:35:39" (2/3) ... [2023-12-25 11:35:45,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570badd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:35:45, skipping insertion in model container [2023-12-25 11:35:45,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:35:45" (3/3) ... [2023-12-25 11:35:45,820 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_peterson.i [2023-12-25 11:35:45,833 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 11:35:45,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 11:35:45,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 11:35:45,882 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;@28b8e8d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 11:35:45,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 11:35:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 67 states have internal predecessors, (89), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 11:35:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 11:35:45,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:45,907 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:35:45,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:45,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1351195561, now seen corresponding path program 1 times [2023-12-25 11:35:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:45,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971630284] [2023-12-25 11:35:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:45,926 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-25 11:35:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:45,928 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-25 11:35:45,932 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-25 11:35:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:46,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 11:35:46,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2023-12-25 11:35:46,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:46,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:46,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971630284] [2023-12-25 11:35:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971630284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:46,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:46,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:35:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634585599] [2023-12-25 11:35:46,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:46,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 11:35:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:46,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 11:35:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:35:46,511 INFO L87 Difference]: Start difference. First operand has 107 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 67 states have internal predecessors, (89), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 11:35:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:46,770 INFO L93 Difference]: Finished difference Result 213 states and 345 transitions. [2023-12-25 11:35:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 11:35:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2023-12-25 11:35:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:46,782 INFO L225 Difference]: With dead ends: 213 [2023-12-25 11:35:46,783 INFO L226 Difference]: Without dead ends: 105 [2023-12-25 11:35:46,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-25 11:35:46,795 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:46,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 11:35:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-25 11:35:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-25 11:35:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 65 states have internal predecessors, (83), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 11:35:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2023-12-25 11:35:46,843 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 131 [2023-12-25 11:35:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:46,843 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2023-12-25 11:35:46,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 11:35:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2023-12-25 11:35:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 11:35:46,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:46,846 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:35:46,855 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-25 11:35:47,051 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-25 11:35:47,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:47,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1373576831, now seen corresponding path program 1 times [2023-12-25 11:35:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:47,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155124218] [2023-12-25 11:35:47,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:47,054 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-25 11:35:47,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:47,056 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-25 11:35:47,059 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-25 11:35:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:47,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:35:47,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-25 11:35:47,477 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:47,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:47,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155124218] [2023-12-25 11:35:47,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155124218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:47,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:47,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:35:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259009191] [2023-12-25 11:35:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:47,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:35:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:47,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:35:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:47,480 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:35:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:48,664 INFO L93 Difference]: Finished difference Result 209 states and 301 transitions. [2023-12-25 11:35:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:35:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2023-12-25 11:35:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:48,668 INFO L225 Difference]: With dead ends: 209 [2023-12-25 11:35:48,668 INFO L226 Difference]: Without dead ends: 108 [2023-12-25 11:35:48,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:48,669 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:48,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 11:35:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-25 11:35:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-12-25 11:35:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 11:35:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2023-12-25 11:35:48,680 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 131 [2023-12-25 11:35:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:48,681 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2023-12-25 11:35:48,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:35:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2023-12-25 11:35:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 11:35:48,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:48,682 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:35:48,693 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-25 11:35:48,883 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-25 11:35:48,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:48,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1880845933, now seen corresponding path program 1 times [2023-12-25 11:35:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:48,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848668309] [2023-12-25 11:35:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:48,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-25 11:35:48,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:48,886 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-25 11:35:48,910 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-25 11:35:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:49,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:35:49,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-25 11:35:49,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:49,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848668309] [2023-12-25 11:35:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848668309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:49,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:49,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:35:49,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47555873] [2023-12-25 11:35:49,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:49,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:35:49,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:49,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:35:49,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:49,355 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:35:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:49,779 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2023-12-25 11:35:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:35:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2023-12-25 11:35:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:49,781 INFO L225 Difference]: With dead ends: 211 [2023-12-25 11:35:49,781 INFO L226 Difference]: Without dead ends: 107 [2023-12-25 11:35:49,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:49,782 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:49,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 11:35:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-25 11:35:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-25 11:35:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 11:35:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2023-12-25 11:35:49,794 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 134 [2023-12-25 11:35:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:49,794 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2023-12-25 11:35:49,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:35:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2023-12-25 11:35:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 11:35:49,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:49,796 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:35:49,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 11:35:49,996 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-25 11:35:49,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:49,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash 633416966, now seen corresponding path program 1 times [2023-12-25 11:35:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:49,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935023748] [2023-12-25 11:35:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:49,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:49,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:50,000 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-25 11:35:50,004 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-25 11:35:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:50,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:35:50,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-25 11:35:50,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:35:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-25 11:35:50,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:50,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935023748] [2023-12-25 11:35:50,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935023748] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:35:50,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:35:50,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 11:35:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774334456] [2023-12-25 11:35:50,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:35:50,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:35:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:35:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:35:50,685 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:35:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:51,847 INFO L93 Difference]: Finished difference Result 214 states and 308 transitions. [2023-12-25 11:35:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:35:51,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 135 [2023-12-25 11:35:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:51,849 INFO L225 Difference]: With dead ends: 214 [2023-12-25 11:35:51,849 INFO L226 Difference]: Without dead ends: 109 [2023-12-25 11:35:51,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:35:51,850 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:51,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 11:35:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-25 11:35:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-25 11:35:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 11:35:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2023-12-25 11:35:51,859 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 135 [2023-12-25 11:35:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:51,859 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2023-12-25 11:35:51,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-12-25 11:35:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2023-12-25 11:35:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-25 11:35:51,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:51,861 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:35:51,874 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-25 11:35:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:52,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:52,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash -593786202, now seen corresponding path program 2 times [2023-12-25 11:35:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408038554] [2023-12-25 11:35:52,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:35:52,072 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-25 11:35:52,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:52,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:35:52,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 11:35:52,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:35:52,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:35:52,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 11:35:52,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2023-12-25 11:35:54,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:54,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408038554] [2023-12-25 11:35:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408038554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:35:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001262189] [2023-12-25 11:35:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:54,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 11:35:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:54,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 11:35:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:35:54,053 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:35:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:54,430 INFO L93 Difference]: Finished difference Result 207 states and 300 transitions. [2023-12-25 11:35:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 11:35:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2023-12-25 11:35:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:54,433 INFO L225 Difference]: With dead ends: 207 [2023-12-25 11:35:54,433 INFO L226 Difference]: Without dead ends: 161 [2023-12-25 11:35:54,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:35:54,436 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 72 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:54,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 458 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 11:35:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-25 11:35:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-12-25 11:35:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 103 states have internal predecessors, (134), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2023-12-25 11:35:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 232 transitions. [2023-12-25 11:35:54,452 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 232 transitions. Word has length 137 [2023-12-25 11:35:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:54,452 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 232 transitions. [2023-12-25 11:35:54,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-25 11:35:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 232 transitions. [2023-12-25 11:35:54,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-25 11:35:54,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:54,456 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:35:54,464 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 (6)] Forceful destruction successful, exit code 0 [2023-12-25 11:35:54,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:54,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:54,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash 86734595, now seen corresponding path program 1 times [2023-12-25 11:35:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174210773] [2023-12-25 11:35:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:54,668 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-25 11:35:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:54,669 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-25 11:35:54,670 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-25 11:35:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:35:55,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:35:55,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2023-12-25 11:35:55,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:35:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2023-12-25 11:35:55,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174210773] [2023-12-25 11:35:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174210773] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:35:55,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:35:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-25 11:35:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31263397] [2023-12-25 11:35:55,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:35:55,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:35:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:55,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:35:55,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:35:55,631 INFO L87 Difference]: Start difference. First operand 161 states and 232 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2023-12-25 11:35:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:58,520 INFO L93 Difference]: Finished difference Result 326 states and 470 transitions. [2023-12-25 11:35:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:35:58,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 201 [2023-12-25 11:35:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:58,522 INFO L225 Difference]: With dead ends: 326 [2023-12-25 11:35:58,522 INFO L226 Difference]: Without dead ends: 173 [2023-12-25 11:35:58,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:35:58,523 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 6 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:58,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 721 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-25 11:35:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-25 11:35:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2023-12-25 11:35:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2023-12-25 11:35:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 246 transitions. [2023-12-25 11:35:58,538 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 246 transitions. Word has length 201 [2023-12-25 11:35:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:58,538 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 246 transitions. [2023-12-25 11:35:58,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2023-12-25 11:35:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2023-12-25 11:35:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-25 11:35:58,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:58,540 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:35:58,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 11:35:58,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:58,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:58,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1247692275, now seen corresponding path program 2 times [2023-12-25 11:35:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:58,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537543827] [2023-12-25 11:35:58,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:35:58,743 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-25 11:35:58,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:58,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:35:58,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 11:35:59,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:35:59,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:35:59,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 11:35:59,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:35:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2023-12-25 11:35:59,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:35:59,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:35:59,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537543827] [2023-12-25 11:35:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537543827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:35:59,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:35:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:35:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737901946] [2023-12-25 11:35:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:35:59,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:35:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:35:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:35:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:59,214 INFO L87 Difference]: Start difference. First operand 173 states and 246 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-25 11:35:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:35:59,596 INFO L93 Difference]: Finished difference Result 316 states and 451 transitions. [2023-12-25 11:35:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:35:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 213 [2023-12-25 11:35:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:35:59,597 INFO L225 Difference]: With dead ends: 316 [2023-12-25 11:35:59,598 INFO L226 Difference]: Without dead ends: 173 [2023-12-25 11:35:59,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:35:59,599 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:35:59,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 11:35:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-25 11:35:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2023-12-25 11:35:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 115 states have internal predecessors, (147), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2023-12-25 11:35:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 245 transitions. [2023-12-25 11:35:59,610 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 245 transitions. Word has length 213 [2023-12-25 11:35:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:35:59,610 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 245 transitions. [2023-12-25 11:35:59,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-25 11:35:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 245 transitions. [2023-12-25 11:35:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-25 11:35:59,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:35:59,612 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:35:59,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 11:35:59,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:35:59,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:35:59,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:35:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash -401784308, now seen corresponding path program 1 times [2023-12-25 11:35:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:35:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278596309] [2023-12-25 11:35:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:35:59,834 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-25 11:35:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:35:59,835 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-25 11:35:59,836 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-25 11:36:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:00,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 11:36:00,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 400 proven. 6 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2023-12-25 11:36:01,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2023-12-25 11:36:02,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:02,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278596309] [2023-12-25 11:36:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278596309] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:02,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2023-12-25 11:36:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645717658] [2023-12-25 11:36:02,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:02,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:36:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:02,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:36:02,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:36:02,394 INFO L87 Difference]: Start difference. First operand 173 states and 245 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 7 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) [2023-12-25 11:36:06,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:09,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:13,382 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2023-12-25 11:36:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:36:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 7 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) Word has length 229 [2023-12-25 11:36:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:13,384 INFO L225 Difference]: With dead ends: 463 [2023-12-25 11:36:13,385 INFO L226 Difference]: Without dead ends: 313 [2023-12-25 11:36:13,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:36:13,386 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 164 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:13,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 415 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 306 Invalid, 1 Unknown, 0 Unchecked, 10.8s Time] [2023-12-25 11:36:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-12-25 11:36:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2023-12-25 11:36:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 204 states have (on average 1.2794117647058822) internal successors, (261), 207 states have internal predecessors, (261), 77 states have call successors, (77), 26 states have call predecessors, (77), 29 states have return successors, (101), 77 states have call predecessors, (101), 77 states have call successors, (101) [2023-12-25 11:36:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 439 transitions. [2023-12-25 11:36:13,409 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 439 transitions. Word has length 229 [2023-12-25 11:36:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:13,409 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 439 transitions. [2023-12-25 11:36:13,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 7 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) [2023-12-25 11:36:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 439 transitions. [2023-12-25 11:36:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-25 11:36:13,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:13,412 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:13,426 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-25 11:36:13,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:36:13,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:13,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:13,613 INFO L85 PathProgramCache]: Analyzing trace with hash 34326798, now seen corresponding path program 1 times [2023-12-25 11:36:13,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:13,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31049554] [2023-12-25 11:36:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:13,614 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-25 11:36:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:13,615 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:36:13,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 11:36:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:14,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 11:36:14,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2023-12-25 11:36:15,791 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:15,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31049554] [2023-12-25 11:36:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31049554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:15,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:15,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 11:36:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634206670] [2023-12-25 11:36:15,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:36:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:36:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:36:15,800 INFO L87 Difference]: Start difference. First operand 311 states and 439 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 3 states have call successors, (32) [2023-12-25 11:36:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:23,423 INFO L93 Difference]: Finished difference Result 835 states and 1216 transitions. [2023-12-25 11:36:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 11:36:23,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 3 states have call successors, (32) Word has length 229 [2023-12-25 11:36:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:23,427 INFO L225 Difference]: With dead ends: 835 [2023-12-25 11:36:23,427 INFO L226 Difference]: Without dead ends: 551 [2023-12-25 11:36:23,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:36:23,429 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 228 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:23,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 439 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-25 11:36:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2023-12-25 11:36:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 526. [2023-12-25 11:36:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 334 states have (on average 1.1736526946107784) internal successors, (392), 335 states have internal predecessors, (392), 139 states have call successors, (139), 38 states have call predecessors, (139), 52 states have return successors, (212), 152 states have call predecessors, (212), 139 states have call successors, (212) [2023-12-25 11:36:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 743 transitions. [2023-12-25 11:36:23,477 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 743 transitions. Word has length 229 [2023-12-25 11:36:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:23,478 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 743 transitions. [2023-12-25 11:36:23,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 3 states have call successors, (32) [2023-12-25 11:36:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 743 transitions. [2023-12-25 11:36:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-25 11:36:23,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:23,481 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:23,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 11:36:23,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:36:23,696 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:23,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash 521400524, now seen corresponding path program 1 times [2023-12-25 11:36:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:23,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223540041] [2023-12-25 11:36:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:23,698 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-25 11:36:23,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:23,699 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-25 11:36:23,700 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-25 11:36:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:25,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:36:25,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:25,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-25 11:36:25,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:36:25,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:36:26,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:36:26,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:36:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2023-12-25 11:36:26,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:26,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223540041] [2023-12-25 11:36:26,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223540041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:26,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:26,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 11:36:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839084995] [2023-12-25 11:36:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:26,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:36:26,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:26,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:36:26,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:26,318 INFO L87 Difference]: Start difference. First operand 526 states and 743 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2023-12-25 11:36:31,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:35,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:39,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:42,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:44,824 INFO L93 Difference]: Finished difference Result 798 states and 1097 transitions. [2023-12-25 11:36:44,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:36:44,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 229 [2023-12-25 11:36:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:44,827 INFO L225 Difference]: With dead ends: 798 [2023-12-25 11:36:44,828 INFO L226 Difference]: Without dead ends: 526 [2023-12-25 11:36:44,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:36:44,829 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 71 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 52 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:44,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 416 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 216 Invalid, 3 Unknown, 0 Unchecked, 18.3s Time] [2023-12-25 11:36:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-12-25 11:36:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 521. [2023-12-25 11:36:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 330 states have (on average 1.1727272727272726) internal successors, (387), 331 states have internal predecessors, (387), 138 states have call successors, (138), 38 states have call predecessors, (138), 52 states have return successors, (208), 151 states have call predecessors, (208), 138 states have call successors, (208) [2023-12-25 11:36:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 733 transitions. [2023-12-25 11:36:44,869 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 733 transitions. Word has length 229 [2023-12-25 11:36:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:44,870 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 733 transitions. [2023-12-25 11:36:44,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2023-12-25 11:36:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 733 transitions. [2023-12-25 11:36:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-25 11:36:44,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:44,873 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:44,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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 11:36:45,088 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-25 11:36:45,088 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:45,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1679305260, now seen corresponding path program 1 times [2023-12-25 11:36:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:45,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295089815] [2023-12-25 11:36:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:45,090 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-25 11:36:45,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:45,091 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-25 11:36:45,093 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-25 11:36:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:46,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 11:36:46,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:48,125 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 13 treesize of output 9 [2023-12-25 11:36:50,048 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-25 11:36:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 450 proven. 2 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2023-12-25 11:36:50,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:51,168 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 19 [2023-12-25 11:36:51,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 [2023-12-25 11:36:52,099 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 19 [2023-12-25 11:36:52,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 [2023-12-25 11:36:52,591 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 19 [2023-12-25 11:36:52,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 [2023-12-25 11:36:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2023-12-25 11:36:53,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:53,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295089815] [2023-12-25 11:36:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295089815] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:53,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:53,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-25 11:36:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171343651] [2023-12-25 11:36:53,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:53,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 11:36:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 11:36:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-12-25 11:36:53,835 INFO L87 Difference]: Start difference. First operand 521 states and 733 transitions. Second operand has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (61), 7 states have call predecessors, (61), 12 states have return successors, (61), 14 states have call predecessors, (61), 12 states have call successors, (61) [2023-12-25 11:36:59,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:03,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:07,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:11,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:15,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:19,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:23,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:27,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:31,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:35,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:39,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:43,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:38:07,933 INFO L93 Difference]: Finished difference Result 1068 states and 1555 transitions. [2023-12-25 11:38:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 11:38:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (61), 7 states have call predecessors, (61), 12 states have return successors, (61), 14 states have call predecessors, (61), 12 states have call successors, (61) Word has length 229 [2023-12-25 11:38:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:38:07,939 INFO L225 Difference]: With dead ends: 1068 [2023-12-25 11:38:07,939 INFO L226 Difference]: Without dead ends: 930 [2023-12-25 11:38:07,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2023-12-25 11:38:07,941 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 672 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 645 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:38:07,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1060 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 1430 Invalid, 12 Unknown, 0 Unchecked, 71.4s Time] [2023-12-25 11:38:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2023-12-25 11:38:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 891. [2023-12-25 11:38:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 542 states have (on average 1.1660516605166051) internal successors, (632), 544 states have internal predecessors, (632), 263 states have call successors, (263), 54 states have call predecessors, (263), 85 states have return successors, (407), 292 states have call predecessors, (407), 263 states have call successors, (407) [2023-12-25 11:38:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1302 transitions. [2023-12-25 11:38:08,019 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1302 transitions. Word has length 229 [2023-12-25 11:38:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:38:08,019 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 1302 transitions. [2023-12-25 11:38:08,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 12 states have call successors, (61), 7 states have call predecessors, (61), 12 states have return successors, (61), 14 states have call predecessors, (61), 12 states have call successors, (61) [2023-12-25 11:38:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1302 transitions. [2023-12-25 11:38:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-25 11:38:08,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:38:08,024 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:38:08,042 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-25 11:38:08,240 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-25 11:38:08,240 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:38:08,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:38:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1942680105, now seen corresponding path program 1 times [2023-12-25 11:38:08,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:38:08,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076449272] [2023-12-25 11:38:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:38:08,242 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-25 11:38:08,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:38:08,243 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-25 11:38:08,245 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-25 11:38:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:10,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:38:10,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:10,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-25 11:38:10,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:38:10,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:38:11,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:38:11,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:38:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2023-12-25 11:38:11,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:38:11,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:38:11,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076449272] [2023-12-25 11:38:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076449272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:38:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:38:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 11:38:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885822724] [2023-12-25 11:38:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:38:11,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:38:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:38:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:38:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:38:11,162 INFO L87 Difference]: Start difference. First operand 891 states and 1302 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2023-12-25 11:38:16,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:20,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:27,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:38:29,798 INFO L93 Difference]: Finished difference Result 1695 states and 2418 transitions. [2023-12-25 11:38:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:38:29,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 245 [2023-12-25 11:38:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:38:29,804 INFO L225 Difference]: With dead ends: 1695 [2023-12-25 11:38:29,805 INFO L226 Difference]: Without dead ends: 900 [2023-12-25 11:38:29,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:38:29,809 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 64 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 48 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:38:29,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 412 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 210 Invalid, 3 Unknown, 0 Unchecked, 18.4s Time] [2023-12-25 11:38:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2023-12-25 11:38:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 884. [2023-12-25 11:38:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 537 states have (on average 1.1657355679702048) internal successors, (626), 538 states have internal predecessors, (626), 262 states have call successors, (262), 54 states have call predecessors, (262), 84 states have return successors, (400), 291 states have call predecessors, (400), 262 states have call successors, (400) [2023-12-25 11:38:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1288 transitions. [2023-12-25 11:38:29,902 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1288 transitions. Word has length 245 [2023-12-25 11:38:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:38:29,903 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 1288 transitions. [2023-12-25 11:38:29,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2023-12-25 11:38:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1288 transitions. [2023-12-25 11:38:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-25 11:38:29,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:38:29,909 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:38:29,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 11:38:30,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:38:30,129 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:38:30,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:38:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash -56805940, now seen corresponding path program 1 times [2023-12-25 11:38:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:38:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462558445] [2023-12-25 11:38:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:38:30,131 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-25 11:38:30,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:38:30,132 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:38:30,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 11:38:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:32,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 11:38:32,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:33,546 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 13 treesize of output 9 [2023-12-25 11:38:34,485 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 11 treesize of output 4 [2023-12-25 11:38:34,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 11:38:34,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-12-25 11:38:38,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:38:38,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2023-12-25 11:38:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2023-12-25 11:38:38,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:38:38,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:38:38,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462558445] [2023-12-25 11:38:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462558445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:38:38,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:38:38,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-25 11:38:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619216423] [2023-12-25 11:38:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:38:38,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 11:38:38,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:38:38,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 11:38:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-25 11:38:38,718 INFO L87 Difference]: Start difference. First operand 884 states and 1288 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 8 states have call successors, (34), 6 states have call predecessors, (34), 7 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2023-12-25 11:38:44,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:48,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:52,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:56,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:00,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:04,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:08,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:12,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:16,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:39:38,281 INFO L93 Difference]: Finished difference Result 1367 states and 1970 transitions. [2023-12-25 11:39:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 11:39:38,282 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 8 states have call successors, (34), 6 states have call predecessors, (34), 7 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 229 [2023-12-25 11:39:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:39:38,286 INFO L225 Difference]: With dead ends: 1367 [2023-12-25 11:39:38,287 INFO L226 Difference]: Without dead ends: 908 [2023-12-25 11:39:38,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2023-12-25 11:39:38,288 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 432 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 454 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.7s IncrementalHoareTripleChecker+Time [2023-12-25 11:39:38,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 790 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 987 Invalid, 9 Unknown, 0 Unchecked, 57.7s Time] [2023-12-25 11:39:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2023-12-25 11:39:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 884. [2023-12-25 11:39:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 537 states have (on average 1.1620111731843576) internal successors, (624), 538 states have internal predecessors, (624), 262 states have call successors, (262), 54 states have call predecessors, (262), 84 states have return successors, (400), 291 states have call predecessors, (400), 262 states have call successors, (400) [2023-12-25 11:39:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1286 transitions. [2023-12-25 11:39:38,360 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1286 transitions. Word has length 229 [2023-12-25 11:39:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:39:38,360 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 1286 transitions. [2023-12-25 11:39:38,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 8 states have call successors, (34), 6 states have call predecessors, (34), 7 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2023-12-25 11:39:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1286 transitions. [2023-12-25 11:39:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-25 11:39:38,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:39:38,365 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:39:38,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 11:39:38,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:39:38,581 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:39:38,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:39:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 800390025, now seen corresponding path program 1 times [2023-12-25 11:39:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:39:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862554397] [2023-12-25 11:39:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:39:38,583 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-25 11:39:38,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:39:38,584 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-25 11:39:38,596 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-25 11:39:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:39:39,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 11:39:39,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:39:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 480 proven. 6 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2023-12-25 11:39:40,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:39:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [2023-12-25 11:39:44,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:39:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862554397] [2023-12-25 11:39:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862554397] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:39:44,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:39:44,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2023-12-25 11:39:44,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739449680] [2023-12-25 11:39:44,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:39:44,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 11:39:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:39:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 11:39:44,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-25 11:39:44,713 INFO L87 Difference]: Start difference. First operand 884 states and 1286 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 11 states have call successors, (59), 6 states have call predecessors, (59), 7 states have return successors, (58), 10 states have call predecessors, (58), 11 states have call successors, (58) [2023-12-25 11:39:50,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:54,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:58,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:02,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:06,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:10,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:14,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:40:37,686 INFO L93 Difference]: Finished difference Result 1926 states and 2722 transitions. [2023-12-25 11:40:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 11:40:37,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 11 states have call successors, (59), 6 states have call predecessors, (59), 7 states have return successors, (58), 10 states have call predecessors, (58), 11 states have call successors, (58) Word has length 245 [2023-12-25 11:40:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:40:37,692 INFO L225 Difference]: With dead ends: 1926 [2023-12-25 11:40:37,692 INFO L226 Difference]: Without dead ends: 1202 [2023-12-25 11:40:37,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 479 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-12-25 11:40:37,695 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 386 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 313 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:40:37,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1509 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1713 Invalid, 7 Unknown, 0 Unchecked, 51.4s Time] [2023-12-25 11:40:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2023-12-25 11:40:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 887. [2023-12-25 11:40:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 538 states have (on average 1.1505576208178439) internal successors, (619), 547 states have internal predecessors, (619), 255 states have call successors, (255), 64 states have call predecessors, (255), 93 states have return successors, (361), 275 states have call predecessors, (361), 255 states have call successors, (361) [2023-12-25 11:40:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1235 transitions. [2023-12-25 11:40:37,828 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1235 transitions. Word has length 245 [2023-12-25 11:40:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:40:37,828 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1235 transitions. [2023-12-25 11:40:37,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 11 states have call successors, (59), 6 states have call predecessors, (59), 7 states have return successors, (58), 10 states have call predecessors, (58), 11 states have call successors, (58) [2023-12-25 11:40:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1235 transitions. [2023-12-25 11:40:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-25 11:40:37,832 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:40:37,832 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:40:37,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 11:40:38,047 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-25 11:40:38,048 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:40:38,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:40:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1073403479, now seen corresponding path program 1 times [2023-12-25 11:40:38,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:40:38,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149961979] [2023-12-25 11:40:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:40:38,049 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-25 11:40:38,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:40:38,051 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-25 11:40:38,080 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-25 11:40:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:40:40,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 11:40:40,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:40:40,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-12-25 11:40:40,791 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-25 11:40:46,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-25 11:40:47,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-25 11:40:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 410 proven. 20 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2023-12-25 11:40:48,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:40:50,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:40:50,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-25 11:40:50,320 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 11:40:50,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-25 11:40:53,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:40:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149961979] [2023-12-25 11:40:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149961979] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:40:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1508834864] [2023-12-25 11:40:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:40:53,044 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 11:40:53,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 11:40:53,045 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 11:40:53,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-25 11:40:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:40:58,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 11:40:58,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:40:58,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-12-25 11:40:59,310 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-25 11:41:01,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-25 11:41:02,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 19 treesize of output 11 [2023-12-25 11:41:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 410 proven. 20 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2023-12-25 11:41:03,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:41:04,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:41:04,937 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-25 11:41:04,949 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 11:41:04,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-25 11:41:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1508834864] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:41:06,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:41:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2023-12-25 11:41:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590672192] [2023-12-25 11:41:06,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:41:06,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 11:41:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:41:06,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 11:41:06,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=564, Unknown=4, NotChecked=0, Total=650 [2023-12-25 11:41:06,279 INFO L87 Difference]: Start difference. First operand 887 states and 1235 transitions. Second operand has 21 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 13 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (40), 11 states have call predecessors, (40), 13 states have call successors, (40) [2023-12-25 11:41:08,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:13,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:17,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:21,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:25,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:30,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:34,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:40,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:41,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:45,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:41:46,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:01,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:42:02,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:42:14,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:42:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:42:24,690 INFO L93 Difference]: Finished difference Result 1358 states and 1944 transitions. [2023-12-25 11:42:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 11:42:24,692 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 13 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (40), 11 states have call predecessors, (40), 13 states have call successors, (40) Word has length 245 [2023-12-25 11:42:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:42:24,695 INFO L225 Difference]: With dead ends: 1358 [2023-12-25 11:42:24,695 INFO L226 Difference]: Without dead ends: 969 [2023-12-25 11:42:24,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 843 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=240, Invalid=1478, Unknown=4, NotChecked=0, Total=1722 [2023-12-25 11:42:24,697 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 263 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 250 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:42:24,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 890 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1556 Invalid, 8 Unknown, 0 Unchecked, 74.1s Time] [2023-12-25 11:42:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2023-12-25 11:42:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 889. [2023-12-25 11:42:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 539 states have (on average 1.150278293135436) internal successors, (620), 549 states have internal predecessors, (620), 255 states have call successors, (255), 64 states have call predecessors, (255), 94 states have return successors, (366), 275 states have call predecessors, (366), 255 states have call successors, (366) [2023-12-25 11:42:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1241 transitions. [2023-12-25 11:42:24,800 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1241 transitions. Word has length 245 [2023-12-25 11:42:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:42:24,800 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1241 transitions. [2023-12-25 11:42:24,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 13 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (40), 11 states have call predecessors, (40), 13 states have call successors, (40) [2023-12-25 11:42:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1241 transitions. [2023-12-25 11:42:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2023-12-25 11:42:24,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:42:24,805 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:42:24,824 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-25 11:42:25,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-12-25 11:42:25,223 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 11:42:25,223 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:42:25,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:42:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash -212572766, now seen corresponding path program 1 times [2023-12-25 11:42:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:42:25,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53691129] [2023-12-25 11:42:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:42:25,225 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-25 11:42:25,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:42:25,226 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-25 11:42:25,227 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-25 11:42:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:42:26,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 11:42:26,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:42:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1746 backedges. 640 proven. 29 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2023-12-25 11:42:28,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:42:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1746 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 1702 trivial. 0 not checked. [2023-12-25 11:42:32,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:42:32,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53691129] [2023-12-25 11:42:32,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53691129] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:42:32,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:42:32,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2023-12-25 11:42:32,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622972876] [2023-12-25 11:42:32,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:42:32,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 11:42:32,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:42:32,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 11:42:32,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 11:42:32,893 INFO L87 Difference]: Start difference. First operand 889 states and 1241 transitions. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (64), 6 states have call predecessors, (64), 10 states have return successors, (64), 11 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-25 11:42:38,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:42,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:46,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:50,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:54,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:58,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:02,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:06,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:10,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:12,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:14,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:43:28,639 INFO L93 Difference]: Finished difference Result 1453 states and 2009 transitions. [2023-12-25 11:43:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 11:43:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (64), 6 states have call predecessors, (64), 10 states have return successors, (64), 11 states have call predecessors, (64), 12 states have call successors, (64) Word has length 277 [2023-12-25 11:43:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:43:28,644 INFO L225 Difference]: With dead ends: 1453 [2023-12-25 11:43:28,645 INFO L226 Difference]: Without dead ends: 939 [2023-12-25 11:43:28,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 541 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2023-12-25 11:43:28,647 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 756 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 729 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.8s IncrementalHoareTripleChecker+Time [2023-12-25 11:43:28,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 788 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 1061 Invalid, 9 Unknown, 0 Unchecked, 53.8s Time] [2023-12-25 11:43:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-12-25 11:43:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 753. [2023-12-25 11:43:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 462 states have (on average 1.132034632034632) internal successors, (523), 469 states have internal predecessors, (523), 206 states have call successors, (206), 59 states have call predecessors, (206), 84 states have return successors, (273), 224 states have call predecessors, (273), 206 states have call successors, (273) [2023-12-25 11:43:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1002 transitions. [2023-12-25 11:43:28,771 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1002 transitions. Word has length 277 [2023-12-25 11:43:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:43:28,771 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 1002 transitions. [2023-12-25 11:43:28,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (64), 6 states have call predecessors, (64), 10 states have return successors, (64), 11 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-25 11:43:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1002 transitions. [2023-12-25 11:43:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-25 11:43:28,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:43:28,775 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:43:28,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 11:43:28,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:43:28,992 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:43:28,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:43:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 970489378, now seen corresponding path program 1 times [2023-12-25 11:43:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:43:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184317730] [2023-12-25 11:43:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:43:28,994 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-25 11:43:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:43:28,995 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:43:28,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 11:43:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:43:30,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:43:30,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2023-12-25 11:43:30,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:43:30,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:43:30,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184317730] [2023-12-25 11:43:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184317730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:43:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:43:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:43:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180718189] [2023-12-25 11:43:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:43:30,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:43:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:43:30,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:43:30,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:43:30,283 INFO L87 Difference]: Start difference. First operand 753 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-12-25 11:43:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:43:31,052 INFO L93 Difference]: Finished difference Result 1382 states and 1899 transitions. [2023-12-25 11:43:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:43:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 248 [2023-12-25 11:43:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:43:31,057 INFO L225 Difference]: With dead ends: 1382 [2023-12-25 11:43:31,057 INFO L226 Difference]: Without dead ends: 759 [2023-12-25 11:43:31,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:43:31,060 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 11:43:31,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 11:43:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-12-25 11:43:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2023-12-25 11:43:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 468 states have (on average 1.1303418803418803) internal successors, (529), 475 states have internal predecessors, (529), 206 states have call successors, (206), 59 states have call predecessors, (206), 84 states have return successors, (273), 224 states have call predecessors, (273), 206 states have call successors, (273) [2023-12-25 11:43:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1008 transitions. [2023-12-25 11:43:31,178 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1008 transitions. Word has length 248 [2023-12-25 11:43:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:43:31,178 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 1008 transitions. [2023-12-25 11:43:31,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-12-25 11:43:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1008 transitions. [2023-12-25 11:43:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-25 11:43:31,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:43:31,182 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:43:31,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 11:43:31,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:43:31,401 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:43:31,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:43:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash 154442148, now seen corresponding path program 1 times [2023-12-25 11:43:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:43:31,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503876718] [2023-12-25 11:43:31,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:43:31,402 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-25 11:43:31,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:43:31,404 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-25 11:43:31,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 11:43:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:43:35,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-25 11:43:35,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:37,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2023-12-25 11:43:37,202 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-25 11:43:37,563 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-25 11:43:38,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:43:38,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 38 [2023-12-25 11:43:38,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-12-25 11:43:42,655 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-25 11:43:44,551 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 23 treesize of output 19 [2023-12-25 11:43:56,382 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 38 treesize of output 36 [2023-12-25 11:43:56,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 45 [2023-12-25 11:43:59,796 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-25 11:43:59,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2023-12-25 11:43:59,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2023-12-25 11:44:02,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2023-12-25 11:44:03,197 INFO L349 Elim1Store]: treesize reduction 249, result has 19.9 percent of original size [2023-12-25 11:44:03,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 131 [2023-12-25 11:45:18,531 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-25 11:45:18,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2023-12-25 11:45:27,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2023-12-25 11:45:27,683 INFO L349 Elim1Store]: treesize reduction 249, result has 19.9 percent of original size [2023-12-25 11:45:27,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 131 [2023-12-25 11:48:27,416 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-25 11:48:27,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:48:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503876718] [2023-12-25 11:48:27,417 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-25 11:48:27,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-12-25 11:48:27,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 11:48:27,618 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-25 11:48:27,619 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2023-12-25 11:48:27,623 INFO L158 Benchmark]: Toolchain (without parser) took 768153.01ms. Allocated memory was 283.1MB in the beginning and 339.7MB in the end (delta: 56.6MB). Free memory was 244.6MB in the beginning and 168.1MB in the end (delta: 76.6MB). Peak memory consumption was 135.0MB. Max. memory is 8.0GB. [2023-12-25 11:48:27,623 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 199.2MB. Free memory was 151.7MB in the beginning and 151.6MB in the end (delta: 137.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 11:48:27,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.11ms. Allocated memory is still 283.1MB. Free memory was 244.2MB in the beginning and 215.5MB in the end (delta: 28.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-25 11:48:27,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.21ms. Allocated memory is still 283.1MB. Free memory was 215.5MB in the beginning and 211.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 11:48:27,623 INFO L158 Benchmark]: Boogie Preprocessor took 142.63ms. Allocated memory is still 283.1MB. Free memory was 211.3MB in the beginning and 202.3MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-25 11:48:27,623 INFO L158 Benchmark]: RCFGBuilder took 5703.12ms. Allocated memory is still 283.1MB. Free memory was 201.8MB in the beginning and 203.5MB in the end (delta: -1.7MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-25 11:48:27,623 INFO L158 Benchmark]: TraceAbstraction took 761806.45ms. Allocated memory was 283.1MB in the beginning and 339.7MB in the end (delta: 56.6MB). Free memory was 203.0MB in the beginning and 168.1MB in the end (delta: 34.9MB). Peak memory consumption was 93.4MB. Max. memory is 8.0GB. [2023-12-25 11:48:27,624 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.14ms. Allocated memory is still 199.2MB. Free memory was 151.7MB in the beginning and 151.6MB in the end (delta: 137.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.11ms. Allocated memory is still 283.1MB. Free memory was 244.2MB in the beginning and 215.5MB in the end (delta: 28.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.21ms. Allocated memory is still 283.1MB. Free memory was 215.5MB in the beginning and 211.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 142.63ms. Allocated memory is still 283.1MB. Free memory was 211.3MB in the beginning and 202.3MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 5703.12ms. Allocated memory is still 283.1MB. Free memory was 201.8MB in the beginning and 203.5MB in the end (delta: -1.7MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 761806.45ms. Allocated memory was 283.1MB in the beginning and 339.7MB in the end (delta: 56.6MB). Free memory was 203.0MB in the beginning and 168.1MB in the end (delta: 34.9MB). Peak memory consumption was 93.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...