/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 13:06:54,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 13:06:54,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 13:06:54,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 13:06:54,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 13:06:54,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 13:06:54,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 13:06:54,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 13:06:54,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 13:06:54,275 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 13:06:54,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 13:06:54,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 13:06:54,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 13:06:54,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 13:06:54,277 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 13:06:54,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 13:06:54,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 13:06:54,277 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 13:06:54,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 13:06:54,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 13:06:54,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 13:06:54,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 13:06:54,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 13:06:54,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 13:06:54,279 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 13:06:54,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 13:06:54,280 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 13:06:54,280 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 13:06:54,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 13:06:54,280 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 13:06:54,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 13:06:54,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 13:06:54,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 13:06:54,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 13:06:54,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:06:54,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 13:06:54,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 13:06:54,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 13:06:54,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 13:06:54,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 13:06:54,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 13:06:54,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 13:06:54,283 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 13:06:54,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 13:06:54,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 13:06:54,284 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 13:06:54,284 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 13:06:54,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 13:06:54,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 13:06:54,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 13:06:54,482 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 13:06:54,482 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 13:06:54,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i [2023-12-24 13:06:55,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 13:06:55,600 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 13:06:55,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i [2023-12-24 13:06:55,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01564672/f043f71f840d444bb2382f49792778e1/FLAGf689b37c1 [2023-12-24 13:06:55,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01564672/f043f71f840d444bb2382f49792778e1 [2023-12-24 13:06:55,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 13:06:55,618 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 13:06:55,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 13:06:55,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 13:06:55,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 13:06:55,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:55,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50505db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55, skipping insertion in model container [2023-12-24 13:06:55,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:55,680 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 13:06:55,782 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i[916,929] [2023-12-24 13:06:55,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:06:55,872 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 13:06:55,880 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i[916,929] [2023-12-24 13:06:55,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:06:55,945 INFO L206 MainTranslator]: Completed translation [2023-12-24 13:06:55,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55 WrapperNode [2023-12-24 13:06:55,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 13:06:55,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 13:06:55,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 13:06:55,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 13:06:55,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:55,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,009 INFO L138 Inliner]: procedures = 36, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 559 [2023-12-24 13:06:56,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 13:06:56,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 13:06:56,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 13:06:56,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 13:06:56,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,062 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 52, 59, 19, 3, 17]. 39 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 4, 3, 1, 1]. The 17 writes are split as follows [0, 6, 5, 4, 1, 1]. [2023-12-24 13:06:56,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 13:06:56,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 13:06:56,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 13:06:56,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 13:06:56,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (1/1) ... [2023-12-24 13:06:56,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:06:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 13:06:56,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-24 13:06:56,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 13:06:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 13:06:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 13:06:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 13:06:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 13:06:56,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 13:06:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 13:06:56,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 13:06:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 13:06:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 13:06:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 13:06:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 13:06:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 13:06:56,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 13:06:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 13:06:56,296 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 13:06:56,297 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 13:06:56,982 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 13:06:57,028 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 13:06:57,028 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 13:06:57,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:06:57 BoogieIcfgContainer [2023-12-24 13:06:57,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 13:06:57,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 13:06:57,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 13:06:57,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 13:06:57,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:06:55" (1/3) ... [2023-12-24 13:06:57,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7233bcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:06:57, skipping insertion in model container [2023-12-24 13:06:57,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:06:55" (2/3) ... [2023-12-24 13:06:57,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7233bcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:06:57, skipping insertion in model container [2023-12-24 13:06:57,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:06:57" (3/3) ... [2023-12-24 13:06:57,035 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-28.i [2023-12-24 13:06:57,048 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 13:06:57,048 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 13:06:57,120 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 13:06:57,124 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;@4ff84b48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 13:06:57,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 13:06:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:06:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-24 13:06:57,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:06:57,142 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:06:57,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:06:57,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:06:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 984086132, now seen corresponding path program 1 times [2023-12-24 13:06:57,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:06:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647278762] [2023-12-24 13:06:57,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:06:57,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:06:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:06:57,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:06:57,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 13:06:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:06:57,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 13:06:57,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:06:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-12-24 13:06:57,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:06:57,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:06:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647278762] [2023-12-24 13:06:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647278762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:06:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:06:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 13:06:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960238728] [2023-12-24 13:06:57,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:06:57,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 13:06:57,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:06:57,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 13:06:57,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:06:57,620 INFO L87 Difference]: Start difference. First operand has 108 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 13:06:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:06:57,667 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2023-12-24 13:06:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 13:06:57,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2023-12-24 13:06:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:06:57,676 INFO L225 Difference]: With dead ends: 213 [2023-12-24 13:06:57,676 INFO L226 Difference]: Without dead ends: 106 [2023-12-24 13:06:57,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:06:57,680 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:06:57,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:06:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-24 13:06:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-12-24 13:06:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:06:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2023-12-24 13:06:57,708 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 123 [2023-12-24 13:06:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:06:57,708 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2023-12-24 13:06:57,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 13:06:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2023-12-24 13:06:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-24 13:06:57,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:06:57,713 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:06:57,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 13:06:57,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:06:57,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:06:57,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:06:57,915 INFO L85 PathProgramCache]: Analyzing trace with hash 443160968, now seen corresponding path program 1 times [2023-12-24 13:06:57,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:06:57,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190092721] [2023-12-24 13:06:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:06:57,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:06:57,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:06:57,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:06:57,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 13:06:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:06:58,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:06:58,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:06:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:06:58,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:06:58,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:06:58,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190092721] [2023-12-24 13:06:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190092721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:06:58,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:06:58,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:06:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991801504] [2023-12-24 13:06:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:06:58,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:06:58,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:06:58,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:06:58,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:06:58,288 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:06:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:06:58,412 INFO L93 Difference]: Finished difference Result 235 states and 345 transitions. [2023-12-24 13:06:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:06:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2023-12-24 13:06:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:06:58,417 INFO L225 Difference]: With dead ends: 235 [2023-12-24 13:06:58,417 INFO L226 Difference]: Without dead ends: 130 [2023-12-24 13:06:58,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 13:06:58,420 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 53 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:06:58,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 718 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:06:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-24 13:06:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2023-12-24 13:06:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:06:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2023-12-24 13:06:58,438 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 123 [2023-12-24 13:06:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:06:58,440 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2023-12-24 13:06:58,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:06:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2023-12-24 13:06:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-24 13:06:58,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:06:58,444 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:06:58,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 13:06:58,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:06:58,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:06:58,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:06:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash 500419270, now seen corresponding path program 1 times [2023-12-24 13:06:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:06:58,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390869378] [2023-12-24 13:06:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:06:58,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:06:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:06:58,654 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:06:58,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 13:06:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:06:58,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:06:58,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:06:59,044 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 95 treesize of output 41 [2023-12-24 13:06:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-24 13:06:59,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:06:59,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:06:59,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390869378] [2023-12-24 13:06:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390869378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:06:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:06:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:06:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028713598] [2023-12-24 13:06:59,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:06:59,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:06:59,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:06:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:06:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:06:59,068 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 13:06:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:06:59,603 INFO L93 Difference]: Finished difference Result 229 states and 332 transitions. [2023-12-24 13:06:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:06:59,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2023-12-24 13:06:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:06:59,605 INFO L225 Difference]: With dead ends: 229 [2023-12-24 13:06:59,605 INFO L226 Difference]: Without dead ends: 118 [2023-12-24 13:06:59,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:06:59,606 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 151 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:06:59,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 477 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 13:06:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-24 13:06:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2023-12-24 13:06:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:06:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2023-12-24 13:06:59,611 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 123 [2023-12-24 13:06:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:06:59,611 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2023-12-24 13:06:59,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 13:06:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2023-12-24 13:06:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-24 13:06:59,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:06:59,612 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:06:59,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 13:06:59,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:06:59,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:06:59,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:06:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1809022412, now seen corresponding path program 1 times [2023-12-24 13:06:59,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:06:59,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373722980] [2023-12-24 13:06:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:06:59,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:06:59,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:06:59,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:06:59,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 13:07:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:00,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:07:00,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:00,196 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 95 treesize of output 41 [2023-12-24 13:07:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-24 13:07:00,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:07:00,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373722980] [2023-12-24 13:07:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373722980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:07:00,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:07:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:07:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683607208] [2023-12-24 13:07:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:00,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:07:00,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:00,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:07:00,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:07:00,215 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 13:07:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:00,672 INFO L93 Difference]: Finished difference Result 229 states and 330 transitions. [2023-12-24 13:07:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:07:00,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2023-12-24 13:07:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:00,674 INFO L225 Difference]: With dead ends: 229 [2023-12-24 13:07:00,674 INFO L226 Difference]: Without dead ends: 118 [2023-12-24 13:07:00,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:07:00,675 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 142 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:00,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 473 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:07:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-24 13:07:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2023-12-24 13:07:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:07:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2023-12-24 13:07:00,680 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 125 [2023-12-24 13:07:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:00,680 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2023-12-24 13:07:00,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 13:07:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2023-12-24 13:07:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 13:07:00,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:00,681 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:00,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 13:07:00,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:00,882 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:00,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1230469894, now seen corresponding path program 1 times [2023-12-24 13:07:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:00,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544098557] [2023-12-24 13:07:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:00,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:00,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:07:00,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 13:07:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:01,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:07:01,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:01,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-12-24 13:07:01,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:07:01,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 13:07:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:07:01,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:07:01,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544098557] [2023-12-24 13:07:01,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544098557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:07:01,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:07:01,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:07:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581850267] [2023-12-24 13:07:01,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:01,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:07:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:07:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:07:01,320 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:02,298 INFO L93 Difference]: Finished difference Result 344 states and 489 transitions. [2023-12-24 13:07:02,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:07:02,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2023-12-24 13:07:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:02,300 INFO L225 Difference]: With dead ends: 344 [2023-12-24 13:07:02,300 INFO L226 Difference]: Without dead ends: 233 [2023-12-24 13:07:02,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-24 13:07:02,301 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 248 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:02,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 811 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 13:07:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-24 13:07:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 221. [2023-12-24 13:07:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 189 states have (on average 1.3650793650793651) internal successors, (258), 190 states have internal predecessors, (258), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 13:07:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 314 transitions. [2023-12-24 13:07:02,312 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 314 transitions. Word has length 127 [2023-12-24 13:07:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:02,312 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 314 transitions. [2023-12-24 13:07:02,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 314 transitions. [2023-12-24 13:07:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-24 13:07:02,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:02,314 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:02,326 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-24 13:07:02,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:02,521 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:02,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:02,522 INFO L85 PathProgramCache]: Analyzing trace with hash -357878008, now seen corresponding path program 1 times [2023-12-24 13:07:02,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:02,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2542566] [2023-12-24 13:07:02,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:02,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:02,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:07:02,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 13:07:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:02,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 13:07:02,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:02,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:07:02,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-24 13:07:03,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:03,157 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 32 treesize of output 14 [2023-12-24 13:07:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 217 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-24 13:07:03,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:07:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-24 13:07:03,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:03,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2542566] [2023-12-24 13:07:03,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2542566] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:07:03,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:07:03,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-24 13:07:03,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659322583] [2023-12-24 13:07:03,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:07:03,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 13:07:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 13:07:03,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:07:03,404 INFO L87 Difference]: Start difference. First operand 221 states and 314 transitions. Second operand has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2023-12-24 13:07:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:04,140 INFO L93 Difference]: Finished difference Result 340 states and 479 transitions. [2023-12-24 13:07:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 13:07:04,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2023-12-24 13:07:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:04,142 INFO L225 Difference]: With dead ends: 340 [2023-12-24 13:07:04,142 INFO L226 Difference]: Without dead ends: 120 [2023-12-24 13:07:04,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:07:04,143 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 560 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:04,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 437 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:07:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-24 13:07:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-12-24 13:07:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:07:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2023-12-24 13:07:04,149 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 127 [2023-12-24 13:07:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:04,150 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2023-12-24 13:07:04,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.454545454545454) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2023-12-24 13:07:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2023-12-24 13:07:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 13:07:04,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:04,151 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:04,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 13:07:04,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:04,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:04,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1747651041, now seen corresponding path program 1 times [2023-12-24 13:07:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784486273] [2023-12-24 13:07:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:04,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:04,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:04,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:07:04,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 13:07:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:04,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:07:04,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:04,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-12-24 13:07:04,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:07:04,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-24 13:07:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:07:04,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:07:04,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784486273] [2023-12-24 13:07:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784486273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:07:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:07:04,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:07:04,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880622514] [2023-12-24 13:07:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:04,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:07:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:04,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:07:04,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:07:04,709 INFO L87 Difference]: Start difference. First operand 120 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:04,814 INFO L93 Difference]: Finished difference Result 239 states and 329 transitions. [2023-12-24 13:07:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:07:04,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2023-12-24 13:07:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:04,817 INFO L225 Difference]: With dead ends: 239 [2023-12-24 13:07:04,817 INFO L226 Difference]: Without dead ends: 120 [2023-12-24 13:07:04,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:07:04,818 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 148 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:04,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 269 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:07:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-24 13:07:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-12-24 13:07:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:07:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2023-12-24 13:07:04,826 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 129 [2023-12-24 13:07:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:04,827 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2023-12-24 13:07:04,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2023-12-24 13:07:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 13:07:04,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:04,828 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:04,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 13:07:05,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:05,029 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:05,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash 159303139, now seen corresponding path program 1 times [2023-12-24 13:07:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:05,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497420566] [2023-12-24 13:07:05,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:05,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:05,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:05,031 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:07:05,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 13:07:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:05,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 13:07:05,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:05,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:07:05,539 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 44 treesize of output 20 [2023-12-24 13:07:05,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:05,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 53 [2023-12-24 13:07:05,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:05,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 53 [2023-12-24 13:07:06,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:06,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 56 [2023-12-24 13:07:06,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:06,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 58 [2023-12-24 13:07:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 13:07:06,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:07:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:07:06,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497420566] [2023-12-24 13:07:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497420566] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:07:06,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:07:06,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2023-12-24 13:07:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570952377] [2023-12-24 13:07:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:06,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:07:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:06,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:07:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-12-24 13:07:06,922 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:07,303 INFO L93 Difference]: Finished difference Result 297 states and 407 transitions. [2023-12-24 13:07:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:07:07,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2023-12-24 13:07:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:07,305 INFO L225 Difference]: With dead ends: 297 [2023-12-24 13:07:07,305 INFO L226 Difference]: Without dead ends: 178 [2023-12-24 13:07:07,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:07:07,306 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 71 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:07,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 505 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:07:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-24 13:07:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 123. [2023-12-24 13:07:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:07:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 167 transitions. [2023-12-24 13:07:07,312 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 167 transitions. Word has length 129 [2023-12-24 13:07:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:07,312 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 167 transitions. [2023-12-24 13:07:07,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2023-12-24 13:07:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 13:07:07,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:07,313 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:07,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 13:07:07,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:07,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:07,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:07,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1646135195, now seen corresponding path program 1 times [2023-12-24 13:07:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862659912] [2023-12-24 13:07:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:07,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:07,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:07,516 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:07:07,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 13:07:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:07,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 13:07:07,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:08,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 13:07:08,004 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 21 treesize of output 21 [2023-12-24 13:07:08,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:08,037 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 66 treesize of output 30 [2023-12-24 13:07:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:07:08,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:07:08,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:08,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862659912] [2023-12-24 13:07:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862659912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:07:08,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:07:08,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:07:08,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20939411] [2023-12-24 13:07:08,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:08,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:07:08,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:07:08,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:07:08,052 INFO L87 Difference]: Start difference. First operand 123 states and 167 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:08,582 INFO L93 Difference]: Finished difference Result 373 states and 508 transitions. [2023-12-24 13:07:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:07:08,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2023-12-24 13:07:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:08,585 INFO L225 Difference]: With dead ends: 373 [2023-12-24 13:07:08,585 INFO L226 Difference]: Without dead ends: 251 [2023-12-24 13:07:08,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:07:08,585 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 202 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:08,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 622 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 13:07:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-24 13:07:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 208. [2023-12-24 13:07:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 183 states have (on average 1.349726775956284) internal successors, (247), 184 states have internal predecessors, (247), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:07:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 287 transitions. [2023-12-24 13:07:08,598 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 287 transitions. Word has length 129 [2023-12-24 13:07:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:08,599 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 287 transitions. [2023-12-24 13:07:08,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 287 transitions. [2023-12-24 13:07:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-24 13:07:08,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:08,601 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:08,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 13:07:08,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:08,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:08,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash 561400147, now seen corresponding path program 1 times [2023-12-24 13:07:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:08,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187617011] [2023-12-24 13:07:08,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:08,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:08,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:08,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:07:08,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 13:07:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:09,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:07:09,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:07:09,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:07:09,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:09,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187617011] [2023-12-24 13:07:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187617011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:07:09,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:07:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:07:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596199409] [2023-12-24 13:07:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:09,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:07:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:07:09,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:07:09,143 INFO L87 Difference]: Start difference. First operand 208 states and 287 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:09,197 INFO L93 Difference]: Finished difference Result 461 states and 639 transitions. [2023-12-24 13:07:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:07:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2023-12-24 13:07:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:09,199 INFO L225 Difference]: With dead ends: 461 [2023-12-24 13:07:09,199 INFO L226 Difference]: Without dead ends: 254 [2023-12-24 13:07:09,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:07:09,200 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 67 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:09,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 578 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:07:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-24 13:07:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 214. [2023-12-24 13:07:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 189 states have (on average 1.3386243386243386) internal successors, (253), 190 states have internal predecessors, (253), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:07:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 293 transitions. [2023-12-24 13:07:09,214 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 293 transitions. Word has length 131 [2023-12-24 13:07:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:09,216 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 293 transitions. [2023-12-24 13:07:09,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:07:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 293 transitions. [2023-12-24 13:07:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-24 13:07:09,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:09,217 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:09,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 13:07:09,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:09,424 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:09,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1293914186, now seen corresponding path program 1 times [2023-12-24 13:07:09,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:09,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128583463] [2023-12-24 13:07:09,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:09,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:07:09,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:09,426 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:07:09,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 13:15:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:15:59,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 13:15:59,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:16:01,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:16:01,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 54 [2023-12-24 13:16:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:16:02,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:16:02,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:16:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128583463] [2023-12-24 13:16:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128583463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:16:02,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:16:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:16:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191250032] [2023-12-24 13:16:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:16:02,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:16:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:16:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:16:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:16:02,105 INFO L87 Difference]: Start difference. First operand 214 states and 293 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:16:17,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:16:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:16:17,779 INFO L93 Difference]: Finished difference Result 458 states and 626 transitions. [2023-12-24 13:16:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:16:17,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2023-12-24 13:16:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:16:17,785 INFO L225 Difference]: With dead ends: 458 [2023-12-24 13:16:17,785 INFO L226 Difference]: Without dead ends: 245 [2023-12-24 13:16:17,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:16:17,786 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 279 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:16:17,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 426 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 12.3s Time] [2023-12-24 13:16:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-24 13:16:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 208. [2023-12-24 13:16:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 183 states have (on average 1.3333333333333333) internal successors, (244), 184 states have internal predecessors, (244), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:16:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 284 transitions. [2023-12-24 13:16:17,796 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 284 transitions. Word has length 131 [2023-12-24 13:16:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:16:17,797 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 284 transitions. [2023-12-24 13:16:17,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:16:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 284 transitions. [2023-12-24 13:16:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-24 13:16:17,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:16:17,798 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:16:17,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 13:16:18,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:16:18,012 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:16:18,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:16:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1935113312, now seen corresponding path program 1 times [2023-12-24 13:16:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:16:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895998062] [2023-12-24 13:16:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:16:18,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:16:18,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:16:18,014 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:16:18,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 13:20:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:20:31,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 13:20:31,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:20:33,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:20:33,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 53 [2023-12-24 13:20:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:20:34,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:20:34,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:20:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895998062] [2023-12-24 13:20:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895998062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:20:34,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:20:34,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:20:34,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691136863] [2023-12-24 13:20:34,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:20:34,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:20:34,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:20:34,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:20:34,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:20:34,854 INFO L87 Difference]: Start difference. First operand 208 states and 284 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:20:38,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:20:40,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 13:20:45,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 13:20:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:20:53,322 INFO L93 Difference]: Finished difference Result 417 states and 568 transitions. [2023-12-24 13:20:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:20:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2023-12-24 13:20:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:20:53,330 INFO L225 Difference]: With dead ends: 417 [2023-12-24 13:20:53,330 INFO L226 Difference]: Without dead ends: 210 [2023-12-24 13:20:53,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:20:53,331 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 179 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:20:53,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 507 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 15.2s Time] [2023-12-24 13:20:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-24 13:20:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2023-12-24 13:20:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 184 states have internal predecessors, (243), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:20:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2023-12-24 13:20:53,340 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 131 [2023-12-24 13:20:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:20:53,341 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2023-12-24 13:20:53,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:20:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2023-12-24 13:20:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 13:20:53,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:20:53,342 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:20:53,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 13:20:53,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:20:53,542 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:20:53,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:20:53,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1865569384, now seen corresponding path program 1 times [2023-12-24 13:20:53,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:20:53,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446923432] [2023-12-24 13:20:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:20:53,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:20:53,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:20:53,545 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:20:53,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 13:20:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:20:53,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 13:20:53,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:20:54,113 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 33 treesize of output 26 [2023-12-24 13:20:54,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:20:54,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 25 [2023-12-24 13:20:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-12-24 13:20:54,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:20:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-24 13:20:56,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:20:56,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446923432] [2023-12-24 13:20:56,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446923432] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:20:56,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:20:56,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-24 13:20:56,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325340048] [2023-12-24 13:20:56,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:20:56,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 13:20:56,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:20:56,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 13:20:56,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:20:56,024 INFO L87 Difference]: Start difference. First operand 208 states and 283 transitions. Second operand has 24 states, 22 states have (on average 4.5) internal successors, (99), 24 states have internal predecessors, (99), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-24 13:21:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:21:01,086 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2023-12-24 13:21:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-24 13:21:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.5) internal successors, (99), 24 states have internal predecessors, (99), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Word has length 133 [2023-12-24 13:21:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:21:01,088 INFO L225 Difference]: With dead ends: 705 [2023-12-24 13:21:01,088 INFO L226 Difference]: Without dead ends: 498 [2023-12-24 13:21:01,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=546, Invalid=1904, Unknown=0, NotChecked=0, Total=2450 [2023-12-24 13:21:01,090 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 1545 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:21:01,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 1834 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-24 13:21:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-12-24 13:21:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 231. [2023-12-24 13:21:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 205 states have (on average 1.3121951219512196) internal successors, (269), 206 states have internal predecessors, (269), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:21:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 309 transitions. [2023-12-24 13:21:01,101 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 309 transitions. Word has length 133 [2023-12-24 13:21:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:21:01,101 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 309 transitions. [2023-12-24 13:21:01,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.5) internal successors, (99), 24 states have internal predecessors, (99), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-24 13:21:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 309 transitions. [2023-12-24 13:21:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 13:21:01,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:21:01,102 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:21:01,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 13:21:01,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:01,311 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:21:01,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:21:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 443259502, now seen corresponding path program 1 times [2023-12-24 13:21:01,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:21:01,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645579095] [2023-12-24 13:21:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:21:01,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:01,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:21:01,313 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:21:01,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-24 13:21:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:21:01,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 13:21:01,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:21:01,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:21:01,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 13:21:02,059 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 80 treesize of output 34 [2023-12-24 13:21:02,171 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 80 treesize of output 34 [2023-12-24 13:21:02,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:02,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 89 [2023-12-24 13:21:03,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:03,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 80 [2023-12-24 13:21:03,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:03,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 82 [2023-12-24 13:21:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 13:21:03,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:21:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:21:04,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:21:04,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645579095] [2023-12-24 13:21:04,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645579095] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:21:04,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:21:04,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 20 [2023-12-24 13:21:04,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270915878] [2023-12-24 13:21:04,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:21:04,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:21:04,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:21:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:21:04,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:21:04,527 INFO L87 Difference]: Start difference. First operand 231 states and 309 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:21:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:21:10,069 INFO L93 Difference]: Finished difference Result 726 states and 981 transitions. [2023-12-24 13:21:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 13:21:10,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2023-12-24 13:21:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:21:10,074 INFO L225 Difference]: With dead ends: 726 [2023-12-24 13:21:10,074 INFO L226 Difference]: Without dead ends: 496 [2023-12-24 13:21:10,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2023-12-24 13:21:10,075 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 319 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:21:10,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1132 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-24 13:21:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-12-24 13:21:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 286. [2023-12-24 13:21:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.323076923076923) internal successors, (344), 261 states have internal predecessors, (344), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:21:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 384 transitions. [2023-12-24 13:21:10,089 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 384 transitions. Word has length 133 [2023-12-24 13:21:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:21:10,089 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 384 transitions. [2023-12-24 13:21:10,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:21:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 384 transitions. [2023-12-24 13:21:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 13:21:10,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:21:10,090 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:21:10,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-24 13:21:10,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:10,300 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:21:10,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:21:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash -567857748, now seen corresponding path program 1 times [2023-12-24 13:21:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:21:10,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454258608] [2023-12-24 13:21:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:21:10,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:10,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:21:10,302 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:21:10,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 13:21:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:21:10,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-24 13:21:10,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:21:10,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:21:11,076 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 68 treesize of output 32 [2023-12-24 13:21:11,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:11,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 65 [2023-12-24 13:21:11,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:11,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 65 [2023-12-24 13:21:12,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:12,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 56 [2023-12-24 13:21:13,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:13,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 56 [2023-12-24 13:21:13,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:13,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 58 [2023-12-24 13:21:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-24 13:21:13,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:21:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:21:13,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:21:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454258608] [2023-12-24 13:21:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454258608] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:21:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:21:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2023-12-24 13:21:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519214940] [2023-12-24 13:21:13,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:21:13,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:21:13,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:21:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:21:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:21:13,912 INFO L87 Difference]: Start difference. First operand 286 states and 384 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:21:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:21:14,670 INFO L93 Difference]: Finished difference Result 732 states and 985 transitions. [2023-12-24 13:21:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:21:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2023-12-24 13:21:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:21:14,672 INFO L225 Difference]: With dead ends: 732 [2023-12-24 13:21:14,672 INFO L226 Difference]: Without dead ends: 447 [2023-12-24 13:21:14,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2023-12-24 13:21:14,673 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 225 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:21:14,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 716 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:21:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-12-24 13:21:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 286. [2023-12-24 13:21:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 261 states have internal predecessors, (342), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 13:21:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 382 transitions. [2023-12-24 13:21:14,684 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 382 transitions. Word has length 133 [2023-12-24 13:21:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:21:14,684 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 382 transitions. [2023-12-24 13:21:14,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 13:21:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 382 transitions. [2023-12-24 13:21:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 13:21:14,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:21:14,685 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:21:14,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-24 13:21:14,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:14,894 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:21:14,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:21:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 623959578, now seen corresponding path program 1 times [2023-12-24 13:21:14,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:21:14,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56306266] [2023-12-24 13:21:14,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:21:14,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:14,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:21:14,896 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:21:14,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-24 13:21:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:21:15,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 13:21:15,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:21:15,451 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 33 treesize of output 26 [2023-12-24 13:21:15,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:15,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 33 [2023-12-24 13:21:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-12-24 13:21:16,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:21:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-24 13:21:18,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:21:18,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56306266] [2023-12-24 13:21:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56306266] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:21:18,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:21:18,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-24 13:21:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54627068] [2023-12-24 13:21:18,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:21:18,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 13:21:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:21:18,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 13:21:18,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:21:18,214 INFO L87 Difference]: Start difference. First operand 286 states and 382 transitions. Second operand has 24 states, 22 states have (on average 4.5) internal successors, (99), 24 states have internal predecessors, (99), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-24 13:21:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:21:33,167 INFO L93 Difference]: Finished difference Result 1064 states and 1426 transitions. [2023-12-24 13:21:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-24 13:21:33,168 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.5) internal successors, (99), 24 states have internal predecessors, (99), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Word has length 133 [2023-12-24 13:21:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:21:33,170 INFO L225 Difference]: With dead ends: 1064 [2023-12-24 13:21:33,170 INFO L226 Difference]: Without dead ends: 779 [2023-12-24 13:21:33,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=697, Invalid=2383, Unknown=0, NotChecked=0, Total=3080 [2023-12-24 13:21:33,172 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 1549 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:21:33,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 2713 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2023-12-24 13:21:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-12-24 13:21:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 356. [2023-12-24 13:21:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 325 states have (on average 1.3138461538461539) internal successors, (427), 327 states have internal predecessors, (427), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 13:21:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 475 transitions. [2023-12-24 13:21:33,188 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 475 transitions. Word has length 133 [2023-12-24 13:21:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:21:33,188 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 475 transitions. [2023-12-24 13:21:33,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.5) internal successors, (99), 24 states have internal predecessors, (99), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-24 13:21:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 475 transitions. [2023-12-24 13:21:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 13:21:33,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:21:33,189 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:21:33,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-24 13:21:33,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:33,398 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:21:33,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:21:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1690041979, now seen corresponding path program 1 times [2023-12-24 13:21:33,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:21:33,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290847862] [2023-12-24 13:21:33,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:21:33,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:33,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:21:33,400 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:21:33,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 13:21:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:21:33,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:21:33,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:21:33,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 13:21:33,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:21:34,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:34,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2023-12-24 13:21:34,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:21:34,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 32 [2023-12-24 13:21:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-12-24 13:21:34,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:21:34,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:21:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290847862] [2023-12-24 13:21:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290847862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:21:34,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:21:34,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 13:21:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704310874] [2023-12-24 13:21:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:21:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:21:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:21:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:21:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-24 13:21:34,564 INFO L87 Difference]: Start difference. First operand 356 states and 475 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 13:21:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:21:37,410 INFO L93 Difference]: Finished difference Result 986 states and 1327 transitions. [2023-12-24 13:21:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:21:37,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2023-12-24 13:21:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:21:37,412 INFO L225 Difference]: With dead ends: 986 [2023-12-24 13:21:37,412 INFO L226 Difference]: Without dead ends: 631 [2023-12-24 13:21:37,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:21:37,414 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 348 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:21:37,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1063 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-24 13:21:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2023-12-24 13:21:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 384. [2023-12-24 13:21:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 353 states have (on average 1.3172804532577904) internal successors, (465), 355 states have internal predecessors, (465), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-24 13:21:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 513 transitions. [2023-12-24 13:21:37,430 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 513 transitions. Word has length 133 [2023-12-24 13:21:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:21:37,430 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 513 transitions. [2023-12-24 13:21:37,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 13:21:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 513 transitions. [2023-12-24 13:21:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 13:21:37,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:21:37,431 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:21:37,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 13:21:37,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:37,640 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:21:37,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:21:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1325061639, now seen corresponding path program 1 times [2023-12-24 13:21:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:21:37,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596235808] [2023-12-24 13:21:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:21:37,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:21:37,642 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:21:37,643 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 Received shutdown request... [2023-12-24 13:21:37,894 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 13:21:37,904 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 13:21:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:21:38,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-24 13:21:38,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:21:38,274 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 13:21:38,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-24 13:21:38,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:21:38,475 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 134 with TraceHistMax 14,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. [2023-12-24 13:21:38,478 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:21:38,480 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:21:38,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:21:38 BoogieIcfgContainer [2023-12-24 13:21:38,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:21:38,482 INFO L158 Benchmark]: Toolchain (without parser) took 882863.94ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 177.4MB in the beginning and 120.7MB in the end (delta: 56.7MB). Peak memory consumption was 103.4MB. Max. memory is 8.0GB. [2023-12-24 13:21:38,482 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 175.1MB. Free memory was 128.3MB in the beginning and 128.1MB in the end (delta: 163.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:21:38,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.15ms. Allocated memory is still 224.4MB. Free memory was 177.4MB in the beginning and 159.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 13:21:38,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.00ms. Allocated memory is still 224.4MB. Free memory was 159.1MB in the beginning and 155.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 13:21:38,482 INFO L158 Benchmark]: Boogie Preprocessor took 96.09ms. Allocated memory is still 224.4MB. Free memory was 155.4MB in the beginning and 149.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-24 13:21:38,482 INFO L158 Benchmark]: RCFGBuilder took 921.71ms. Allocated memory is still 224.4MB. Free memory was 149.1MB in the beginning and 103.5MB in the end (delta: 45.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2023-12-24 13:21:38,483 INFO L158 Benchmark]: TraceAbstraction took 881451.27ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 103.0MB in the beginning and 120.7MB in the end (delta: -17.7MB). Peak memory consumption was 28.9MB. Max. memory is 8.0GB. [2023-12-24 13:21:38,483 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.86ms. Allocated memory is still 175.1MB. Free memory was 128.3MB in the beginning and 128.1MB in the end (delta: 163.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.15ms. Allocated memory is still 224.4MB. Free memory was 177.4MB in the beginning and 159.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.00ms. Allocated memory is still 224.4MB. Free memory was 159.1MB in the beginning and 155.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 96.09ms. Allocated memory is still 224.4MB. Free memory was 155.4MB in the beginning and 149.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 921.71ms. Allocated memory is still 224.4MB. Free memory was 149.1MB in the beginning and 103.5MB in the end (delta: 45.6MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 881451.27ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 103.0MB in the beginning and 120.7MB in the end (delta: -17.7MB). Peak memory consumption was 28.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 134 with TraceHistMax 14,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.4s, OverallIterations: 18, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 67.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 6137 SdHoareTripleChecker+Valid, 51.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6086 mSDsluCounter, 13433 SdHoareTripleChecker+Invalid, 48.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10756 mSDsCounter, 573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5713 IncrementalHoareTripleChecker+Invalid, 6288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 573 mSolverCounterUnsat, 2677 mSDtfsCounter, 5713 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3073 GetRequests, 2820 SyntacticMatches, 1 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=17, InterpolantAutomatonStates: 203, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1527 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 783.8s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 2193 NumberOfCodeBlocks, 2193 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2958 ConstructedInterpolants, 124 QuantifiedInterpolants, 42514 SizeOfPredicates, 155 NumberOfNonLiveVariables, 5082 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 23 InterpolantComputations, 14 PerfectInterpolantSequences, 8114/8372 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown