/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 15:51:26,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 15:51:26,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 15:51:26,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 15:51:26,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 15:51:26,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 15:51:26,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 15:51:26,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 15:51:26,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 15:51:26,253 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 15:51:26,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 15:51:26,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 15:51:26,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 15:51:26,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 15:51:26,255 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 15:51:26,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 15:51:26,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 15:51:26,255 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 15:51:26,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 15:51:26,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 15:51:26,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 15:51:26,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 15:51:26,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 15:51:26,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 15:51:26,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 15:51:26,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 15:51:26,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 15:51:26,258 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 15:51:26,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 15:51:26,258 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 15:51:26,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 15:51:26,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 15:51:26,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 15:51:26,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 15:51:26,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:51:26,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 15:51:26,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 15:51:26,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 15:51:26,260 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 15:51:26,260 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 15:51:26,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 15:51:26,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 15:51:26,261 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 15:51:26,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 15:51:26,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 15:51:26,261 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 15:51:26,261 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 15:51:26,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 15:51:26,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 15:51:26,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 15:51:26,461 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 15:51:26,463 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 15:51:26,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-12-16 15:51:27,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 15:51:27,585 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 15:51:27,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-12-16 15:51:27,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c45bee227/a88e6b12d6694f6eb5a17a8f5be75b5d/FLAG1a44cd471 [2023-12-16 15:51:27,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c45bee227/a88e6b12d6694f6eb5a17a8f5be75b5d [2023-12-16 15:51:27,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 15:51:27,610 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 15:51:27,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 15:51:27,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 15:51:27,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 15:51:27,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:27,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@683e468f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27, skipping insertion in model container [2023-12-16 15:51:27,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:27,650 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 15:51:27,779 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i[916,929] [2023-12-16 15:51:27,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:51:27,857 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 15:51:27,865 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i[916,929] [2023-12-16 15:51:27,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:51:27,907 INFO L206 MainTranslator]: Completed translation [2023-12-16 15:51:27,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27 WrapperNode [2023-12-16 15:51:27,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 15:51:27,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 15:51:27,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 15:51:27,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 15:51:27,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:27,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:27,950 INFO L138 Inliner]: procedures = 33, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2023-12-16 15:51:27,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 15:51:27,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 15:51:27,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 15:51:27,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 15:51:27,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:27,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:27,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:27,994 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 11, 6, 6, 14, 3, 12, 12, 10, 10, 6, 7, 8]. 13 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1]. [2023-12-16 15:51:27,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:27,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:28,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:28,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:28,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:28,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:28,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 15:51:28,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 15:51:28,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 15:51:28,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 15:51:28,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (1/1) ... [2023-12-16 15:51:28,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:51:28,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 15:51:28,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 15:51:28,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 15:51:28,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 15:51:28,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-16 15:51:28,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-16 15:51:28,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2023-12-16 15:51:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2023-12-16 15:51:28,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-16 15:51:28,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-16 15:51:28,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-16 15:51:28,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-16 15:51:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-16 15:51:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-16 15:51:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-16 15:51:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-12-16 15:51:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-12-16 15:51:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2023-12-16 15:51:28,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2023-12-16 15:51:28,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2023-12-16 15:51:28,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2023-12-16 15:51:28,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2023-12-16 15:51:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2023-12-16 15:51:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2023-12-16 15:51:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 15:51:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 15:51:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 15:51:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 15:51:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-16 15:51:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-16 15:51:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-16 15:51:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-16 15:51:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-16 15:51:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-16 15:51:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-16 15:51:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-16 15:51:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-16 15:51:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 15:51:28,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 15:51:28,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-16 15:51:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-16 15:51:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-16 15:51:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-16 15:51:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-16 15:51:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 15:51:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 15:51:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 15:51:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 15:51:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-16 15:51:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-16 15:51:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-16 15:51:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-16 15:51:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-16 15:51:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-16 15:51:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-16 15:51:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-16 15:51:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-16 15:51:28,302 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 15:51:28,304 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 15:51:28,946 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 15:51:28,988 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 15:51:28,988 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 15:51:28,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:51:28 BoogieIcfgContainer [2023-12-16 15:51:28,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 15:51:28,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 15:51:28,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 15:51:28,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 15:51:28,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:51:27" (1/3) ... [2023-12-16 15:51:28,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f810e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:51:28, skipping insertion in model container [2023-12-16 15:51:28,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:51:27" (2/3) ... [2023-12-16 15:51:28,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f810e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:51:28, skipping insertion in model container [2023-12-16 15:51:28,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:51:28" (3/3) ... [2023-12-16 15:51:28,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-76.i [2023-12-16 15:51:29,007 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 15:51:29,007 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 15:51:29,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 15:51:29,056 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;@47a6ebd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 15:51:29,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 15:51:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 15:51:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 15:51:29,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:29,074 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:29,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:29,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash -325546568, now seen corresponding path program 1 times [2023-12-16 15:51:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:29,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029409683] [2023-12-16 15:51:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:29,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:29,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:29,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:29,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 15:51:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:29,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 15:51:29,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-16 15:51:29,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:29,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029409683] [2023-12-16 15:51:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029409683] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 15:51:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034611341] [2023-12-16 15:51:29,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:29,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 15:51:29,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 15:51:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:51:29,487 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 15:51:29,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:29,551 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-16 15:51:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 15:51:29,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-12-16 15:51:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:29,562 INFO L225 Difference]: With dead ends: 183 [2023-12-16 15:51:29,562 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 15:51:29,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:51:29,567 INFO L413 NwaCegarLoop]: 124 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, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:29,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:51:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 15:51:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-16 15:51:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 15:51:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-16 15:51:29,614 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-12-16 15:51:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:29,614 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-16 15:51:29,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 15:51:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-16 15:51:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 15:51:29,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:29,620 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:29,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:29,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:29,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:29,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -748288644, now seen corresponding path program 1 times [2023-12-16 15:51:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:29,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441395181] [2023-12-16 15:51:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:29,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:29,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:29,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:29,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 15:51:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:30,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:51:30,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:30,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 15:51:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:30,127 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:30,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441395181] [2023-12-16 15:51:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441395181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:30,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:30,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 15:51:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472425152] [2023-12-16 15:51:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:30,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:51:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:51:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:51:30,134 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:30,175 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-12-16 15:51:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:51:30,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-12-16 15:51:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:30,176 INFO L225 Difference]: With dead ends: 177 [2023-12-16 15:51:30,176 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 15:51:30,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:51:30,178 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:30,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:51:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 15:51:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-16 15:51:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 15:51:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-12-16 15:51:30,184 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-12-16 15:51:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:30,185 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-12-16 15:51:30,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-12-16 15:51:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 15:51:30,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:30,187 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:30,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:30,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:30,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:30,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash -104011146, now seen corresponding path program 1 times [2023-12-16 15:51:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386208209] [2023-12-16 15:51:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:30,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:30,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:30,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:30,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 15:51:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:30,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 15:51:30,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:30,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-16 15:51:31,025 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 63 treesize of output 47 [2023-12-16 15:51:31,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-12-16 15:51:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-16 15:51:31,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:31,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:31,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386208209] [2023-12-16 15:51:31,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386208209] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:51:31,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:51:31,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2023-12-16 15:51:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338972132] [2023-12-16 15:51:31,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:31,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:51:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:31,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:51:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-16 15:51:31,195 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:31,365 INFO L93 Difference]: Finished difference Result 237 states and 336 transitions. [2023-12-16 15:51:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:51:31,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-12-16 15:51:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:31,367 INFO L225 Difference]: With dead ends: 237 [2023-12-16 15:51:31,368 INFO L226 Difference]: Without dead ends: 149 [2023-12-16 15:51:31,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:51:31,369 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 125 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:31,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 528 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:51:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-16 15:51:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2023-12-16 15:51:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 125 states have internal predecessors, (169), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 15:51:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 207 transitions. [2023-12-16 15:51:31,383 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 207 transitions. Word has length 115 [2023-12-16 15:51:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:31,384 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 207 transitions. [2023-12-16 15:51:31,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 207 transitions. [2023-12-16 15:51:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 15:51:31,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:31,385 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:31,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 15:51:31,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:31,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:31,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash 713637304, now seen corresponding path program 1 times [2023-12-16 15:51:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500800022] [2023-12-16 15:51:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:31,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:31,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:31,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 15:51:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:31,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:51:31,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:31,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 15:51:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:31,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:31,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500800022] [2023-12-16 15:51:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500800022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:31,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:51:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315900097] [2023-12-16 15:51:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:31,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:51:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:51:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:51:31,920 INFO L87 Difference]: Start difference. First operand 146 states and 207 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:32,073 INFO L93 Difference]: Finished difference Result 435 states and 614 transitions. [2023-12-16 15:51:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:51:32,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-12-16 15:51:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:32,076 INFO L225 Difference]: With dead ends: 435 [2023-12-16 15:51:32,076 INFO L226 Difference]: Without dead ends: 290 [2023-12-16 15:51:32,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:51:32,077 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 188 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:32,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 511 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:51:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-12-16 15:51:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 244. [2023-12-16 15:51:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 201 states have (on average 1.3383084577114428) internal successors, (269), 203 states have internal predecessors, (269), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 15:51:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 345 transitions. [2023-12-16 15:51:32,100 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 345 transitions. Word has length 115 [2023-12-16 15:51:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:32,100 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 345 transitions. [2023-12-16 15:51:32,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 345 transitions. [2023-12-16 15:51:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 15:51:32,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:32,101 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:32,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:32,312 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-16 15:51:32,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:32,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -800207029, now seen corresponding path program 1 times [2023-12-16 15:51:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826560426] [2023-12-16 15:51:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:32,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:32,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:32,314 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-16 15:51:32,315 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-16 15:51:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:32,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:51:32,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:32,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:32,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826560426] [2023-12-16 15:51:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826560426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:51:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814543669] [2023-12-16 15:51:32,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:32,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:51:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:32,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:51:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:51:32,526 INFO L87 Difference]: Start difference. First operand 244 states and 345 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:32,579 INFO L93 Difference]: Finished difference Result 536 states and 758 transitions. [2023-12-16 15:51:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:51:32,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-16 15:51:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:32,590 INFO L225 Difference]: With dead ends: 536 [2023-12-16 15:51:32,590 INFO L226 Difference]: Without dead ends: 301 [2023-12-16 15:51:32,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:51:32,591 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 72 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:32,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 484 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:51:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-12-16 15:51:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 253. [2023-12-16 15:51:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 210 states have (on average 1.3238095238095238) internal successors, (278), 212 states have internal predecessors, (278), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 15:51:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 354 transitions. [2023-12-16 15:51:32,604 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 354 transitions. Word has length 117 [2023-12-16 15:51:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:32,604 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 354 transitions. [2023-12-16 15:51:32,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 354 transitions. [2023-12-16 15:51:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 15:51:32,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:32,605 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:32,614 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-16 15:51:32,810 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-16 15:51:32,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:32,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash -868922403, now seen corresponding path program 1 times [2023-12-16 15:51:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:32,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335862590] [2023-12-16 15:51:32,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:32,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:32,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:32,815 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:32,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 15:51:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:33,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 15:51:33,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:33,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:33,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335862590] [2023-12-16 15:51:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335862590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:33,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:33,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:51:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775863661] [2023-12-16 15:51:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:33,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:51:33,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:51:33,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:51:33,065 INFO L87 Difference]: Start difference. First operand 253 states and 354 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:33,264 INFO L93 Difference]: Finished difference Result 605 states and 848 transitions. [2023-12-16 15:51:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 15:51:33,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-16 15:51:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:33,266 INFO L225 Difference]: With dead ends: 605 [2023-12-16 15:51:33,266 INFO L226 Difference]: Without dead ends: 361 [2023-12-16 15:51:33,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:51:33,267 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 99 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:33,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 647 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:51:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-12-16 15:51:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 256. [2023-12-16 15:51:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 213 states have (on average 1.3192488262910798) internal successors, (281), 215 states have internal predecessors, (281), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 15:51:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 357 transitions. [2023-12-16 15:51:33,278 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 357 transitions. Word has length 119 [2023-12-16 15:51:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:33,279 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 357 transitions. [2023-12-16 15:51:33,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 357 transitions. [2023-12-16 15:51:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 15:51:33,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:33,280 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:33,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:33,484 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-16 15:51:33,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:33,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash -444346526, now seen corresponding path program 1 times [2023-12-16 15:51:33,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917939031] [2023-12-16 15:51:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:33,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:33,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:33,487 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-16 15:51:33,487 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-16 15:51:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:33,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:51:33,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:33,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-16 15:51:34,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 13 treesize of output 9 [2023-12-16 15:51:34,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-16 15:51:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-16 15:51:34,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:34,379 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 15:51:34,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-16 15:51:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 15:51:34,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:34,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917939031] [2023-12-16 15:51:34,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917939031] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:51:34,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:51:34,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 15:51:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955780818] [2023-12-16 15:51:34,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:51:34,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 15:51:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:34,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 15:51:34,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:51:34,447 INFO L87 Difference]: Start difference. First operand 256 states and 357 transitions. Second operand has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:35,504 INFO L93 Difference]: Finished difference Result 644 states and 881 transitions. [2023-12-16 15:51:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 15:51:35,505 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 121 [2023-12-16 15:51:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:35,507 INFO L225 Difference]: With dead ends: 644 [2023-12-16 15:51:35,507 INFO L226 Difference]: Without dead ends: 397 [2023-12-16 15:51:35,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 15:51:35,508 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 514 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:35,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 715 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 15:51:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-12-16 15:51:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 322. [2023-12-16 15:51:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 251 states have (on average 1.2709163346613546) internal successors, (319), 253 states have internal predecessors, (319), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-16 15:51:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2023-12-16 15:51:35,527 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 121 [2023-12-16 15:51:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:35,528 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2023-12-16 15:51:35,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.416666666666667) internal successors, (77), 14 states have internal predecessors, (77), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2023-12-16 15:51:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 15:51:35,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:35,529 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:35,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:35,736 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-16 15:51:35,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:35,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash 434146884, now seen corresponding path program 1 times [2023-12-16 15:51:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540176178] [2023-12-16 15:51:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:35,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:35,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:35,738 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:35,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 15:51:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:35,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 15:51:35,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:36,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:51:36,043 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 155 treesize of output 65 [2023-12-16 15:51:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-12-16 15:51:36,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:36,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:36,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540176178] [2023-12-16 15:51:36,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540176178] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:36,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:36,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:51:36,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755029713] [2023-12-16 15:51:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:36,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:51:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:36,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:51:36,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:51:36,062 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 15:51:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:36,593 INFO L93 Difference]: Finished difference Result 645 states and 883 transitions. [2023-12-16 15:51:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 15:51:36,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-12-16 15:51:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:36,602 INFO L225 Difference]: With dead ends: 645 [2023-12-16 15:51:36,602 INFO L226 Difference]: Without dead ends: 346 [2023-12-16 15:51:36,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 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-16 15:51:36,603 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 116 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:36,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 395 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 15:51:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-12-16 15:51:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 322. [2023-12-16 15:51:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 251 states have (on average 1.254980079681275) internal successors, (315), 253 states have internal predecessors, (315), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-16 15:51:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 435 transitions. [2023-12-16 15:51:36,627 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 435 transitions. Word has length 121 [2023-12-16 15:51:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:36,627 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 435 transitions. [2023-12-16 15:51:36,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 15:51:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 435 transitions. [2023-12-16 15:51:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 15:51:36,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:36,628 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:36,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:36,834 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-16 15:51:36,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:36,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash 107640202, now seen corresponding path program 1 times [2023-12-16 15:51:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:36,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813159718] [2023-12-16 15:51:36,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:36,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:36,836 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-16 15:51:36,845 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-16 15:51:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:37,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:51:37,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:37,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 15:51:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:37,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:37,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813159718] [2023-12-16 15:51:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813159718] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 15:51:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11023716] [2023-12-16 15:51:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:37,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:51:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:37,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:51:37,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:51:37,073 INFO L87 Difference]: Start difference. First operand 322 states and 435 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:37,112 INFO L93 Difference]: Finished difference Result 618 states and 837 transitions. [2023-12-16 15:51:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:51:37,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-16 15:51:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:37,114 INFO L225 Difference]: With dead ends: 618 [2023-12-16 15:51:37,114 INFO L226 Difference]: Without dead ends: 340 [2023-12-16 15:51:37,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:51:37,116 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 33 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:37,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:51:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-12-16 15:51:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 322. [2023-12-16 15:51:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 251 states have (on average 1.2430278884462151) internal successors, (312), 253 states have internal predecessors, (312), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-16 15:51:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 432 transitions. [2023-12-16 15:51:37,139 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 432 transitions. Word has length 123 [2023-12-16 15:51:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:37,139 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 432 transitions. [2023-12-16 15:51:37,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 432 transitions. [2023-12-16 15:51:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 15:51:37,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:37,141 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:37,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:37,347 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-16 15:51:37,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:37,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1755275364, now seen corresponding path program 1 times [2023-12-16 15:51:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:37,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081634756] [2023-12-16 15:51:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:37,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:37,349 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:37,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 15:51:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:37,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 15:51:37,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:37,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-16 15:51:38,003 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 66 treesize of output 54 [2023-12-16 15:51:38,006 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 70 treesize of output 50 [2023-12-16 15:51:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 185 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-16 15:51:38,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:38,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:38,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081634756] [2023-12-16 15:51:38,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081634756] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:51:38,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:51:38,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2023-12-16 15:51:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756579954] [2023-12-16 15:51:38,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:38,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:51:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:51:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-12-16 15:51:38,198 INFO L87 Difference]: Start difference. First operand 322 states and 432 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:38,405 INFO L93 Difference]: Finished difference Result 694 states and 931 transitions. [2023-12-16 15:51:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 15:51:38,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-16 15:51:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:38,408 INFO L225 Difference]: With dead ends: 694 [2023-12-16 15:51:38,408 INFO L226 Difference]: Without dead ends: 508 [2023-12-16 15:51:38,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-12-16 15:51:38,409 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 180 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:38,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 933 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:51:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-12-16 15:51:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 488. [2023-12-16 15:51:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 390 states have (on average 1.2487179487179487) internal successors, (487), 394 states have internal predecessors, (487), 82 states have call successors, (82), 15 states have call predecessors, (82), 15 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-16 15:51:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 651 transitions. [2023-12-16 15:51:38,430 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 651 transitions. Word has length 125 [2023-12-16 15:51:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:38,431 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 651 transitions. [2023-12-16 15:51:38,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 651 transitions. [2023-12-16 15:51:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 15:51:38,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:38,432 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:38,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:38,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:38,637 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:38,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1811915382, now seen corresponding path program 1 times [2023-12-16 15:51:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:38,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594945533] [2023-12-16 15:51:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:38,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:38,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:38,639 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:38,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 15:51:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:38,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:51:38,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:39,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-16 15:51:39,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 15:51:39,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-16 15:51:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-16 15:51:39,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:39,357 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 15:51:39,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-16 15:51:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 15:51:39,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594945533] [2023-12-16 15:51:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594945533] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:51:39,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:51:39,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 15:51:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967088900] [2023-12-16 15:51:39,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:51:39,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 15:51:39,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:39,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 15:51:39,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:51:39,410 INFO L87 Difference]: Start difference. First operand 488 states and 651 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:40,412 INFO L93 Difference]: Finished difference Result 864 states and 1145 transitions. [2023-12-16 15:51:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 15:51:40,415 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 126 [2023-12-16 15:51:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:40,418 INFO L225 Difference]: With dead ends: 864 [2023-12-16 15:51:40,418 INFO L226 Difference]: Without dead ends: 512 [2023-12-16 15:51:40,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 15:51:40,419 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 598 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:40,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 598 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 15:51:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2023-12-16 15:51:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 488. [2023-12-16 15:51:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 390 states have (on average 1.2435897435897436) internal successors, (485), 394 states have internal predecessors, (485), 82 states have call successors, (82), 15 states have call predecessors, (82), 15 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-16 15:51:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 649 transitions. [2023-12-16 15:51:40,445 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 649 transitions. Word has length 126 [2023-12-16 15:51:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:40,446 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 649 transitions. [2023-12-16 15:51:40,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 649 transitions. [2023-12-16 15:51:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 15:51:40,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:40,447 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:40,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:40,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:40,647 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:40,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1952463992, now seen corresponding path program 1 times [2023-12-16 15:51:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:40,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250718437] [2023-12-16 15:51:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:40,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:40,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:40,649 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:40,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 15:51:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:40,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 15:51:40,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:41,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-16 15:51:41,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 15:51:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-12-16 15:51:41,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:41,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:41,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250718437] [2023-12-16 15:51:41,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250718437] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:51:41,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:51:41,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2023-12-16 15:51:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40523390] [2023-12-16 15:51:41,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:41,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:51:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:51:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:51:41,269 INFO L87 Difference]: Start difference. First operand 488 states and 649 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:41,367 INFO L93 Difference]: Finished difference Result 978 states and 1294 transitions. [2023-12-16 15:51:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:51:41,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-16 15:51:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:41,371 INFO L225 Difference]: With dead ends: 978 [2023-12-16 15:51:41,371 INFO L226 Difference]: Without dead ends: 534 [2023-12-16 15:51:41,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 15:51:41,374 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 153 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:41,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 475 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:51:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-12-16 15:51:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 504. [2023-12-16 15:51:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 402 states have (on average 1.228855721393035) internal successors, (494), 406 states have internal predecessors, (494), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-16 15:51:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 658 transitions. [2023-12-16 15:51:41,399 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 658 transitions. Word has length 126 [2023-12-16 15:51:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:41,401 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 658 transitions. [2023-12-16 15:51:41,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 658 transitions. [2023-12-16 15:51:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-16 15:51:41,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:41,402 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:41,408 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-16 15:51:41,608 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-16 15:51:41,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:41,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 219418967, now seen corresponding path program 1 times [2023-12-16 15:51:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:41,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414928286] [2023-12-16 15:51:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:41,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:41,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:41,611 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-16 15:51:41,611 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-16 15:51:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:41,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 15:51:41,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:42,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-16 15:51:42,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2023-12-16 15:51:42,428 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 63 treesize of output 39 [2023-12-16 15:51:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 56 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 15:51:42,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:42,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414928286] [2023-12-16 15:51:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414928286] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:51:42,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:51:42,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2023-12-16 15:51:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134786636] [2023-12-16 15:51:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:42,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:51:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:51:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-12-16 15:51:42,599 INFO L87 Difference]: Start difference. First operand 504 states and 658 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:42,772 INFO L93 Difference]: Finished difference Result 901 states and 1157 transitions. [2023-12-16 15:51:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 15:51:42,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-16 15:51:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:42,776 INFO L225 Difference]: With dead ends: 901 [2023-12-16 15:51:42,776 INFO L226 Difference]: Without dead ends: 899 [2023-12-16 15:51:42,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2023-12-16 15:51:42,777 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 101 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:42,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 553 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:51:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2023-12-16 15:51:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 894. [2023-12-16 15:51:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 714 states have (on average 1.2058823529411764) internal successors, (861), 723 states have internal predecessors, (861), 143 states have call successors, (143), 36 states have call predecessors, (143), 36 states have return successors, (143), 134 states have call predecessors, (143), 143 states have call successors, (143) [2023-12-16 15:51:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1147 transitions. [2023-12-16 15:51:42,818 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1147 transitions. Word has length 127 [2023-12-16 15:51:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:42,818 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1147 transitions. [2023-12-16 15:51:42,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1147 transitions. [2023-12-16 15:51:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-16 15:51:42,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:42,820 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:42,825 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-16 15:51:43,025 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-16 15:51:43,025 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:43,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1851347754, now seen corresponding path program 1 times [2023-12-16 15:51:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:43,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237429053] [2023-12-16 15:51:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:43,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:43,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:43,028 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:43,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-16 15:51:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:43,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 15:51:43,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:43,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-16 15:51:43,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-16 15:51:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-12-16 15:51:43,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:43,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237429053] [2023-12-16 15:51:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237429053] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:51:43,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:51:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2023-12-16 15:51:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504080696] [2023-12-16 15:51:43,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:43,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:51:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:43,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:51:43,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:51:43,588 INFO L87 Difference]: Start difference. First operand 894 states and 1147 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:43,693 INFO L93 Difference]: Finished difference Result 1578 states and 2023 transitions. [2023-12-16 15:51:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:51:43,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-16 15:51:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:43,697 INFO L225 Difference]: With dead ends: 1578 [2023-12-16 15:51:43,697 INFO L226 Difference]: Without dead ends: 910 [2023-12-16 15:51:43,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 15:51:43,698 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:43,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 378 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:51:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2023-12-16 15:51:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 890. [2023-12-16 15:51:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 706 states have (on average 1.1940509915014164) internal successors, (843), 715 states have internal predecessors, (843), 143 states have call successors, (143), 40 states have call predecessors, (143), 40 states have return successors, (143), 134 states have call predecessors, (143), 143 states have call successors, (143) [2023-12-16 15:51:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1129 transitions. [2023-12-16 15:51:43,740 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1129 transitions. Word has length 127 [2023-12-16 15:51:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:43,740 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1129 transitions. [2023-12-16 15:51:43,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1129 transitions. [2023-12-16 15:51:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 15:51:43,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:43,741 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:43,760 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-16 15:51:43,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:43,946 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:43,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash 758284978, now seen corresponding path program 1 times [2023-12-16 15:51:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:43,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170434116] [2023-12-16 15:51:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:43,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:43,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:43,948 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:43,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-16 15:51:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:44,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:51:44,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:44,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-16 15:51:44,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 15:51:44,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-16 15:51:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-16 15:51:44,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:44,815 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 15:51:44,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-16 15:51:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 15:51:44,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:44,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170434116] [2023-12-16 15:51:44,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170434116] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:51:44,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:51:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 15:51:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552974391] [2023-12-16 15:51:44,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:51:44,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 15:51:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 15:51:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:51:44,856 INFO L87 Difference]: Start difference. First operand 890 states and 1129 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:45,934 INFO L93 Difference]: Finished difference Result 1794 states and 2269 transitions. [2023-12-16 15:51:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 15:51:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 128 [2023-12-16 15:51:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:45,938 INFO L225 Difference]: With dead ends: 1794 [2023-12-16 15:51:45,938 INFO L226 Difference]: Without dead ends: 956 [2023-12-16 15:51:45,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 15:51:45,941 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 389 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:45,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 755 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 15:51:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2023-12-16 15:51:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 890. [2023-12-16 15:51:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 706 states have (on average 1.188385269121813) internal successors, (839), 715 states have internal predecessors, (839), 143 states have call successors, (143), 40 states have call predecessors, (143), 40 states have return successors, (143), 134 states have call predecessors, (143), 143 states have call successors, (143) [2023-12-16 15:51:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1125 transitions. [2023-12-16 15:51:45,986 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1125 transitions. Word has length 128 [2023-12-16 15:51:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:45,987 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1125 transitions. [2023-12-16 15:51:45,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1125 transitions. [2023-12-16 15:51:45,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 15:51:45,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:45,988 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:45,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:46,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:46,193 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:46,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1438343348, now seen corresponding path program 1 times [2023-12-16 15:51:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66880159] [2023-12-16 15:51:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:46,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:46,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:46,195 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:46,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-16 15:51:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:46,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 15:51:46,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 15:51:46,423 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:46,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:46,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66880159] [2023-12-16 15:51:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66880159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 15:51:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131093814] [2023-12-16 15:51:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:46,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:51:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:46,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:51:46,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:51:46,425 INFO L87 Difference]: Start difference. First operand 890 states and 1125 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:46,536 INFO L93 Difference]: Finished difference Result 1756 states and 2223 transitions. [2023-12-16 15:51:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 15:51:46,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-16 15:51:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:46,540 INFO L225 Difference]: With dead ends: 1756 [2023-12-16 15:51:46,540 INFO L226 Difference]: Without dead ends: 918 [2023-12-16 15:51:46,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:51:46,542 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 76 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:46,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 695 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:51:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2023-12-16 15:51:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 900. [2023-12-16 15:51:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 716 states have (on average 1.1801675977653632) internal successors, (845), 725 states have internal predecessors, (845), 143 states have call successors, (143), 40 states have call predecessors, (143), 40 states have return successors, (143), 134 states have call predecessors, (143), 143 states have call successors, (143) [2023-12-16 15:51:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1131 transitions. [2023-12-16 15:51:46,631 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1131 transitions. Word has length 128 [2023-12-16 15:51:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:46,632 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1131 transitions. [2023-12-16 15:51:46,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1131 transitions. [2023-12-16 15:51:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 15:51:46,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:46,633 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:46,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:46,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:46,839 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:46,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash 924463645, now seen corresponding path program 1 times [2023-12-16 15:51:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:46,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478704581] [2023-12-16 15:51:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:46,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:46,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:46,841 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:46,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-16 15:51:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:47,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:51:47,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:47,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-16 15:51:47,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 15:51:47,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-16 15:51:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-16 15:51:47,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:47,622 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 15:51:47,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-16 15:51:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 15:51:47,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:47,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478704581] [2023-12-16 15:51:47,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478704581] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:51:47,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:51:47,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 15:51:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053656064] [2023-12-16 15:51:47,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:51:47,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 15:51:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 15:51:47,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:51:47,670 INFO L87 Difference]: Start difference. First operand 900 states and 1131 transitions. Second operand has 14 states, 12 states have (on average 6.583333333333333) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:48,745 INFO L93 Difference]: Finished difference Result 1557 states and 1949 transitions. [2023-12-16 15:51:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 15:51:48,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.583333333333333) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 129 [2023-12-16 15:51:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:48,749 INFO L225 Difference]: With dead ends: 1557 [2023-12-16 15:51:48,750 INFO L226 Difference]: Without dead ends: 709 [2023-12-16 15:51:48,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 15:51:48,753 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 714 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:48,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 683 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 15:51:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2023-12-16 15:51:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 669. [2023-12-16 15:51:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 535 states have (on average 1.1794392523364485) internal successors, (631), 541 states have internal predecessors, (631), 104 states have call successors, (104), 29 states have call predecessors, (104), 29 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2023-12-16 15:51:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 839 transitions. [2023-12-16 15:51:48,810 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 839 transitions. Word has length 129 [2023-12-16 15:51:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:48,811 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 839 transitions. [2023-12-16 15:51:48,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.583333333333333) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 839 transitions. [2023-12-16 15:51:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 15:51:48,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:48,812 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:48,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 (18)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:49,012 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-16 15:51:49,013 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:49,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1161950554, now seen corresponding path program 1 times [2023-12-16 15:51:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:49,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239296828] [2023-12-16 15:51:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:49,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-16 15:51:49,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:49,014 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-16 15:51:49,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-16 15:51:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:49,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:51:49,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:49,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-16 15:51:49,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 15:51:49,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-16 15:51:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-16 15:51:49,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:49,854 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 15:51:49,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-16 15:51:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 15:51:49,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239296828] [2023-12-16 15:51:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239296828] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:51:49,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:51:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 15:51:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852021538] [2023-12-16 15:51:49,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:51:49,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 15:51:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 15:51:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:51:49,898 INFO L87 Difference]: Start difference. First operand 669 states and 839 transitions. Second operand has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:50,986 INFO L93 Difference]: Finished difference Result 1312 states and 1630 transitions. [2023-12-16 15:51:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 15:51:50,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 130 [2023-12-16 15:51:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:50,989 INFO L225 Difference]: With dead ends: 1312 [2023-12-16 15:51:50,989 INFO L226 Difference]: Without dead ends: 687 [2023-12-16 15:51:50,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 15:51:50,992 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 525 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:50,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 683 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 15:51:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-16 15:51:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 645. [2023-12-16 15:51:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 511 states have (on average 1.1585127201565557) internal successors, (592), 517 states have internal predecessors, (592), 104 states have call successors, (104), 29 states have call predecessors, (104), 29 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2023-12-16 15:51:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 800 transitions. [2023-12-16 15:51:51,048 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 800 transitions. Word has length 130 [2023-12-16 15:51:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:51,048 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 800 transitions. [2023-12-16 15:51:51,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 15:51:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 800 transitions. [2023-12-16 15:51:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-16 15:51:51,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:51,050 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:51,072 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-16 15:51:51,272 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-16 15:51:51,273 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:51,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash 142588831, now seen corresponding path program 1 times [2023-12-16 15:51:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057850429] [2023-12-16 15:51:51,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:51,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:51,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:51,276 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:51,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-16 15:51:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:51,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 15:51:51,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:52,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:51:52,252 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 46 treesize of output 34 [2023-12-16 15:51:52,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 15:51:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 21 proven. 859 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2023-12-16 15:51:52,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:52,489 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 15:51:52,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-16 15:51:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 72 proven. 59 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2023-12-16 15:51:52,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057850429] [2023-12-16 15:51:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057850429] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:51:52,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:51:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 15:51:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632382646] [2023-12-16 15:51:52,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:51:52,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 15:51:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 15:51:52,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:51:52,791 INFO L87 Difference]: Start difference. First operand 645 states and 800 transitions. Second operand has 14 states, 12 states have (on average 9.25) internal successors, (111), 14 states have internal predecessors, (111), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) [2023-12-16 15:51:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:53,523 INFO L93 Difference]: Finished difference Result 1193 states and 1478 transitions. [2023-12-16 15:51:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 15:51:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.25) internal successors, (111), 14 states have internal predecessors, (111), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) Word has length 243 [2023-12-16 15:51:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:53,528 INFO L225 Difference]: With dead ends: 1193 [2023-12-16 15:51:53,528 INFO L226 Difference]: Without dead ends: 683 [2023-12-16 15:51:53,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 15:51:53,536 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 483 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:53,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 734 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:51:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-12-16 15:51:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 645. [2023-12-16 15:51:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 511 states have (on average 1.1545988258317026) internal successors, (590), 517 states have internal predecessors, (590), 104 states have call successors, (104), 29 states have call predecessors, (104), 29 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2023-12-16 15:51:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 798 transitions. [2023-12-16 15:51:53,580 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 798 transitions. Word has length 243 [2023-12-16 15:51:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:53,581 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 798 transitions. [2023-12-16 15:51:53,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.25) internal successors, (111), 14 states have internal predecessors, (111), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) [2023-12-16 15:51:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 798 transitions. [2023-12-16 15:51:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-16 15:51:53,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:53,582 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:53,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:53,799 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:53,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1540507036, now seen corresponding path program 1 times [2023-12-16 15:51:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:53,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328939844] [2023-12-16 15:51:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:53,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:53,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:53,801 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:53,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-16 15:51:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:54,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 15:51:54,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:54,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 15:51:54,850 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 46 treesize of output 34 [2023-12-16 15:51:54,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 15:51:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 19 proven. 861 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2023-12-16 15:51:54,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:55,145 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-16 15:51:55,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-12-16 15:51:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 70 proven. 61 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2023-12-16 15:51:55,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:55,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328939844] [2023-12-16 15:51:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328939844] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 15:51:55,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:51:55,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 15:51:55,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767931705] [2023-12-16 15:51:55,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:51:55,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 15:51:55,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:55,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 15:51:55,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:51:55,459 INFO L87 Difference]: Start difference. First operand 645 states and 798 transitions. Second operand has 14 states, 12 states have (on average 9.75) internal successors, (117), 14 states have internal predecessors, (117), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) [2023-12-16 15:51:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:56,226 INFO L93 Difference]: Finished difference Result 1024 states and 1262 transitions. [2023-12-16 15:51:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 15:51:56,226 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.75) internal successors, (117), 14 states have internal predecessors, (117), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) Word has length 245 [2023-12-16 15:51:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:56,228 INFO L225 Difference]: With dead ends: 1024 [2023-12-16 15:51:56,228 INFO L226 Difference]: Without dead ends: 514 [2023-12-16 15:51:56,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 15:51:56,231 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 311 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:56,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 615 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:51:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-12-16 15:51:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 484. [2023-12-16 15:51:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 380 states have (on average 1.1368421052631579) internal successors, (432), 384 states have internal predecessors, (432), 80 states have call successors, (80), 23 states have call predecessors, (80), 23 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-16 15:51:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 592 transitions. [2023-12-16 15:51:56,262 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 592 transitions. Word has length 245 [2023-12-16 15:51:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:56,263 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 592 transitions. [2023-12-16 15:51:56,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.75) internal successors, (117), 14 states have internal predecessors, (117), 4 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 2 states have call predecessors, (50), 4 states have call successors, (50) [2023-12-16 15:51:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 592 transitions. [2023-12-16 15:51:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-16 15:51:56,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:56,264 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:56,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-16 15:51:56,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:56,474 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:56,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash 697077930, now seen corresponding path program 1 times [2023-12-16 15:51:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920650821] [2023-12-16 15:51:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:56,476 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:56,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-16 15:51:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:56,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 15:51:56,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2023-12-16 15:51:56,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:51:56,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:56,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920650821] [2023-12-16 15:51:56,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920650821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:51:56,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:51:56,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 15:51:56,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58158153] [2023-12-16 15:51:56,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:56,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:51:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:56,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:51:56,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:51:56,848 INFO L87 Difference]: Start difference. First operand 484 states and 592 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:56,908 INFO L93 Difference]: Finished difference Result 835 states and 1026 transitions. [2023-12-16 15:51:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:51:56,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 247 [2023-12-16 15:51:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:56,910 INFO L225 Difference]: With dead ends: 835 [2023-12-16 15:51:56,910 INFO L226 Difference]: Without dead ends: 486 [2023-12-16 15:51:56,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:51:56,911 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:56,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:51:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-12-16 15:51:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2023-12-16 15:51:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 382 states have (on average 1.1361256544502618) internal successors, (434), 386 states have internal predecessors, (434), 80 states have call successors, (80), 23 states have call predecessors, (80), 23 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-16 15:51:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 594 transitions. [2023-12-16 15:51:56,938 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 594 transitions. Word has length 247 [2023-12-16 15:51:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:56,938 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 594 transitions. [2023-12-16 15:51:56,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 594 transitions. [2023-12-16 15:51:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-16 15:51:56,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:51:56,940 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:51:56,948 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 (22)] Ended with exit code 0 [2023-12-16 15:51:57,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:57,149 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:51:57,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:51:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash 110271916, now seen corresponding path program 1 times [2023-12-16 15:51:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:51:57,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474511438] [2023-12-16 15:51:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:51:57,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:51:57,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:51:57,150 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:51:57,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-16 15:51:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:51:57,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 15:51:57,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:51:58,542 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 58 treesize of output 46 [2023-12-16 15:51:58,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-12-16 15:51:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 21 proven. 1122 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-12-16 15:51:59,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:51:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1776 trivial. 0 not checked. [2023-12-16 15:51:59,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:51:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474511438] [2023-12-16 15:51:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474511438] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:51:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:51:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 16 [2023-12-16 15:51:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434577183] [2023-12-16 15:51:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:51:59,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:51:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:51:59,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:51:59,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-16 15:51:59,903 INFO L87 Difference]: Start difference. First operand 486 states and 594 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:51:59,950 INFO L93 Difference]: Finished difference Result 648 states and 783 transitions. [2023-12-16 15:51:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:51:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 247 [2023-12-16 15:51:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:51:59,952 INFO L225 Difference]: With dead ends: 648 [2023-12-16 15:51:59,953 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 15:51:59,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-16 15:51:59,954 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:51:59,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:51:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 15:51:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 15:51:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 15:51:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 15:51:59,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2023-12-16 15:51:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:51:59,955 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 15:51:59,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 15:51:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 15:51:59,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 15:51:59,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 15:51:59,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-16 15:52:00,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:52:00,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 15:52:05,271 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 15:52:05,271 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 15:52:05,271 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 15:52:05,271 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 15:52:05,272 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (let ((.cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse9 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse7 ((_ sign_extend 24) .cse9)) (bvsle ((_ zero_extend 24) .cse9) (_ bv0 32)))))) (.cse0 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))))) (.cse1 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse2 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse3 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse4 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (bvadd (_ bv4294967280 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))))))) (let ((.cse8 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 .cse1 (= .cse7 ((_ sign_extend 24) (_ bv1 8))) (= .cse8 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse2 .cse3 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse8)) .cse4 .cse6))))) [2023-12-16 15:52:05,272 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-16 15:52:05,272 INFO L895 garLoopResultBuilder]: At program point L118-2(lines 118 124) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (let ((.cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse9 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse7 ((_ sign_extend 24) .cse9)) (bvsle ((_ zero_extend 24) .cse9) (_ bv0 32)))))) (.cse0 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))))) (.cse1 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse2 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse3 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse4 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (bvadd (_ bv4294967280 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))))))) (let ((.cse8 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 .cse1 (= .cse7 ((_ sign_extend 24) (_ bv1 8))) (= .cse8 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse2 .cse3 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse8)) .cse4 .cse6))))) [2023-12-16 15:52:05,272 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 15:52:05,272 INFO L899 garLoopResultBuilder]: For program point L118-3(lines 118 124) no Hoare annotation was computed. [2023-12-16 15:52:05,272 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 15:52:05,272 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 15:52:05,272 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5 .cse6)) (and .cse0 .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,272 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-16 15:52:05,272 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-12-16 15:52:05,273 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (let ((.cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse9 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse7 ((_ sign_extend 24) .cse9)) (bvsle ((_ zero_extend 24) .cse9) (_ bv0 32)))))) (.cse0 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))))) (.cse1 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse2 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse3 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse4 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) (bvadd (_ bv4294967280 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))))))) (let ((.cse8 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 .cse1 (= .cse7 ((_ sign_extend 24) (_ bv1 8))) (= .cse8 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse2 .cse3 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse8)) .cse4 .cse6))))) [2023-12-16 15:52:05,273 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-16 15:52:05,273 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5 .cse6)) (and .cse0 .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,273 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-16 15:52:05,273 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-16 15:52:05,273 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2023-12-16 15:52:05,273 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5 .cse6)) (and .cse0 .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,273 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-16 15:52:05,273 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse1 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse2 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv252 8)))) (and (= .cse0 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse1 .cse2 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse0)) .cse3 .cse4)) (and .cse1 .cse2 .cse3 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse5 ((_ extract 7 0) v_arrayElimCell_28))) (and (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) .cse5)) (bvsle ((_ zero_extend 24) .cse5) (_ bv0 32))))) .cse4))) [2023-12-16 15:52:05,273 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-16 15:52:05,273 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5 .cse6)) (and .cse0 .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,273 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-16 15:52:05,273 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 66) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse1 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse2 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse0 ((_ sign_extend 24) (_ bv252 8)))) (and (= .cse0 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse1 .cse2 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse0)) .cse3 .cse4)) (and .cse1 .cse2 .cse3 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse5 ((_ extract 7 0) v_arrayElimCell_28))) (and (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 24) .cse5)) (bvsle ((_ zero_extend 24) .cse5) (_ bv0 32))))) .cse4))) [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 81) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse5 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5)) (and .cse0 .cse3 .cse4 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse6 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse6)) (bvsle ((_ zero_extend 24) .cse6) (_ bv0 32))))) .cse5))) [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse1 (= ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset)) |ULTIMATE.start_updateVariables_#t~mem40#1|)) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse2 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse3 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 .cse1 (= .cse2 ((_ sign_extend 24) (_ bv1 8))) (= .cse3 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse4 .cse5 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse3)) .cse6)) (and .cse0 .cse1 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse2 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 65) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-12-16 15:52:05,274 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L895 garLoopResultBuilder]: At program point L94-8(line 94) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse3 (not |ULTIMATE.start_updateVariables_#t~short44#1|)) (.cse4 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 .cse5 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse6 .cse7)) (and .cse0 (exists ((v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse8 ((_ extract 7 0) v_arrayElimCell_5))) (and (= .cse1 ((_ sign_extend 24) .cse8)) (bvsle ((_ zero_extend 24) .cse8) (_ bv0 32))))) .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 64) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L62-2(lines 56 66) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-2(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-3(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-4(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-5(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-6(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-8(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-10(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-12(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,275 INFO L899 garLoopResultBuilder]: For program point L112-14(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-15(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5 .cse6)) (and .cse0 .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-16(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-17(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-19(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-21(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-23(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-25(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-26(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-27(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,277 INFO L899 garLoopResultBuilder]: For program point L112-29(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-30(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-31(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-32(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-34(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-35(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-37(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-39(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-41(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L112-43(line 112) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5 .cse6)) (and .cse0 .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 82) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5 .cse6)) (and .cse0 .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse0 (= ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))))) (.cse3 (= ~var_1_5_Pointer~0.offset |~#var_1_5~0.offset|)) (.cse4 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse5 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) ~var_1_5_Pointer~0.offset))) (_ bv0 32))) (.cse1 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 24) (_ bv252 8)))) (and .cse0 (= .cse1 ((_ sign_extend 24) (_ bv1 8))) (= .cse2 (select (select |#memory_int#7| |~#var_1_8~0.base|) |~#var_1_8~0.offset|)) .cse3 .cse4 (= ~last_1_var_1_8~0 ((_ extract 7 0) .cse2)) .cse5 .cse6)) (and .cse0 .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_28 (_ BitVec 32))) (let ((.cse7 ((_ extract 7 0) v_arrayElimCell_28))) (and (= .cse1 ((_ sign_extend 24) .cse7)) (bvsle ((_ zero_extend 24) .cse7) (_ bv0 32))))) .cse6))) [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-16 15:52:05,278 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2023-12-16 15:52:05,279 INFO L899 garLoopResultBuilder]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2023-12-16 15:52:05,279 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 72) no Hoare annotation was computed. [2023-12-16 15:52:05,279 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2023-12-16 15:52:05,281 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:52:05,282 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 15:52:05,289 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,289 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,295 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,296 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,296 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_28 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(v_arrayElimCell_28[7:0]) && ~bvsle~32(~zero_extend~32~8(v_arrayElimCell_28[7:0]), 0bv32)) could not be translated [2023-12-16 15:52:05,296 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 15:52:05,296 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,296 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_28 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(v_arrayElimCell_28[7:0]) && ~bvsle~32(~zero_extend~32~8(v_arrayElimCell_28[7:0]), 0bv32)) could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,297 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~#var_1_8~0!base][~#var_1_8~0!offset] could not be translated [2023-12-16 15:52:05,298 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated [2023-12-16 15:52:05,298 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 15:52:05,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:52:05 BoogieIcfgContainer [2023-12-16 15:52:05,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 15:52:05,299 INFO L158 Benchmark]: Toolchain (without parser) took 37688.69ms. Allocated memory was 191.9MB in the beginning and 558.9MB in the end (delta: 367.0MB). Free memory was 132.0MB in the beginning and 212.2MB in the end (delta: -80.2MB). Peak memory consumption was 319.8MB. Max. memory is 8.0GB. [2023-12-16 15:52:05,299 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 191.9MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 15:52:05,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.97ms. Allocated memory is still 191.9MB. Free memory was 131.7MB in the beginning and 117.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 15:52:05,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.22ms. Allocated memory is still 191.9MB. Free memory was 117.0MB in the beginning and 113.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 15:52:05,299 INFO L158 Benchmark]: Boogie Preprocessor took 102.47ms. Allocated memory is still 191.9MB. Free memory was 113.9MB in the beginning and 107.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 15:52:05,299 INFO L158 Benchmark]: RCFGBuilder took 935.04ms. Allocated memory was 191.9MB in the beginning and 268.4MB in the end (delta: 76.5MB). Free memory was 107.6MB in the beginning and 187.9MB in the end (delta: -80.3MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2023-12-16 15:52:05,299 INFO L158 Benchmark]: TraceAbstraction took 36308.05ms. Allocated memory was 268.4MB in the beginning and 558.9MB in the end (delta: 290.5MB). Free memory was 187.4MB in the beginning and 212.2MB in the end (delta: -24.8MB). Peak memory consumption was 297.6MB. Max. memory is 8.0GB. [2023-12-16 15:52:05,300 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.20ms. Allocated memory is still 191.9MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.97ms. Allocated memory is still 191.9MB. Free memory was 131.7MB in the beginning and 117.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.22ms. Allocated memory is still 191.9MB. Free memory was 117.0MB in the beginning and 113.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 102.47ms. Allocated memory is still 191.9MB. Free memory was 113.9MB in the beginning and 107.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 935.04ms. Allocated memory was 191.9MB in the beginning and 268.4MB in the end (delta: 76.5MB). Free memory was 107.6MB in the beginning and 187.9MB in the end (delta: -80.3MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * TraceAbstraction took 36308.05ms. Allocated memory was 268.4MB in the beginning and 558.9MB in the end (delta: 290.5MB). Free memory was 187.4MB in the beginning and 212.2MB in the end (delta: -24.8MB). Peak memory consumption was 297.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_28 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(v_arrayElimCell_28[7:0]) && ~bvsle~32(~zero_extend~32~8(v_arrayElimCell_28[7:0]), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_28 : bv32 :: #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] == ~sign_extend~32~8(v_arrayElimCell_28[7:0]) && ~bvsle~32(~zero_extend~32~8(v_arrayElimCell_28[7:0]), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~#var_1_8~0!base][~#var_1_8~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][~var_1_5_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.2s, OverallIterations: 22, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4832 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4832 mSDsluCounter, 11381 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8478 mSDsCounter, 729 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3671 IncrementalHoareTripleChecker+Invalid, 4400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 729 mSolverCounterUnsat, 2903 mSDtfsCounter, 3671 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5334 GetRequests, 4983 SyntacticMatches, 7 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=16, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 652 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 1315 PreInvPairs, 1373 NumberOfFragments, 1896 HoareAnnotationTreeSize, 1315 FormulaSimplifications, 120661 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 17 FormulaSimplificationsInter, 56352 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 3187 NumberOfCodeBlocks, 3187 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5141 ConstructedInterpolants, 183 QuantifiedInterpolants, 26405 SizeOfPredicates, 199 NumberOfNonLiveVariables, 7765 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 35 InterpolantComputations, 15 PerfectInterpolantSequences, 19193/24325 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (((((null & 127) == (null & 127)) && ((null & 127) <= 0)) || ((((null & 127) == (null & 127)) && ((null & 127) <= 0)) && ((null & 127) == (((-16 + (null & 127)) % 4294967296) & 127)))) || ((((null & 127) == (null & 127)) && (last_1_var_1_8 == (-4 & 127))) && ((null & 127) <= 0))) RESULT: Ultimate proved your program to be correct! [2023-12-16 15:52:05,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...