/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:35:56,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:35:57,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:35:57,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:35:57,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:35:57,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:35:57,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:35:57,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:35:57,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:35:57,047 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:35:57,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:35:57,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:35:57,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:35:57,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:35:57,048 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:35:57,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:35:57,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:35:57,049 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:35:57,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:35:57,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:35:57,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:35:57,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:35:57,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:35:57,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:35:57,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:35:57,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:35:57,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:35:57,051 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:35:57,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:35:57,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:35:57,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:35:57,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:35:57,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:35:57,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:35:57,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:35:57,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:35:57,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:35:57,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:35:57,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:35:57,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:35:57,052 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:35:57,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:35:57,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:35:57,053 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:35:57,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:35:57,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:35:57,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:35:57,241 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:35:57,241 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:35:57,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-2.i [2023-12-16 04:35:58,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:35:58,578 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:35:58,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-2.i [2023-12-16 04:35:58,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0c307f7/4c42e84d1c234f58a021c45b4f4b8a85/FLAGb6982811d [2023-12-16 04:35:58,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0c307f7/4c42e84d1c234f58a021c45b4f4b8a85 [2023-12-16 04:35:58,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:35:58,602 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:35:58,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:35:58,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:35:58,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:35:58,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:58,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c916f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58, skipping insertion in model container [2023-12-16 04:35:58,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:58,659 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:35:58,880 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2023-12-16 04:35:58,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:35:58,920 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:35:58,949 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2023-12-16 04:35:58,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:35:58,999 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:35:58,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58 WrapperNode [2023-12-16 04:35:58,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:35:59,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:35:59,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:35:59,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:35:59,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,044 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 207 [2023-12-16 04:35:59,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:35:59,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:35:59,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:35:59,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:35:59,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,094 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 6, 8, 18, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 7, 1]. [2023-12-16 04:35:59,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:35:59,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:35:59,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:35:59,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:35:59,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (1/1) ... [2023-12-16 04:35:59,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:35:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:35:59,150 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 04:35:59,156 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 04:35:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-16 04:35:59,172 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:35:59,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2023-12-16 04:35:59,174 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-16 04:35:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-16 04:35:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2023-12-16 04:35:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2023-12-16 04:35:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:35:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:35:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:35:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:35:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:35:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2023-12-16 04:35:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2023-12-16 04:35:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:35:59,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:35:59,283 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:35:59,285 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:35:59,573 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:35:59,600 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:35:59,601 INFO L309 CfgBuilder]: Removed 33 assume(true) statements. [2023-12-16 04:35:59,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:35:59 BoogieIcfgContainer [2023-12-16 04:35:59,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:35:59,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:35:59,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:35:59,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:35:59,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:35:58" (1/3) ... [2023-12-16 04:35:59,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130e5ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:35:59, skipping insertion in model container [2023-12-16 04:35:59,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:58" (2/3) ... [2023-12-16 04:35:59,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130e5ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:35:59, skipping insertion in model container [2023-12-16 04:35:59,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:35:59" (3/3) ... [2023-12-16 04:35:59,607 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2023-12-16 04:35:59,618 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:35:59,619 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:35:59,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:35:59,675 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;@295c1907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:35:59,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:35:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 70 states have (on average 1.7142857142857142) internal successors, (120), 76 states have internal predecessors, (120), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:35:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 04:35:59,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:59,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:59,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:59,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1056251351, now seen corresponding path program 1 times [2023-12-16 04:35:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:59,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507706843] [2023-12-16 04:35:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:35:59,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:59,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507706843] [2023-12-16 04:35:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507706843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:59,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:59,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:35:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827288092] [2023-12-16 04:35:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:59,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:35:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:35:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:35:59,855 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.7142857142857142) internal successors, (120), 76 states have internal predecessors, (120), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:35:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:59,906 INFO L93 Difference]: Finished difference Result 177 states and 315 transitions. [2023-12-16 04:35:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:35:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 04:35:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:59,915 INFO L225 Difference]: With dead ends: 177 [2023-12-16 04:35:59,916 INFO L226 Difference]: Without dead ends: 84 [2023-12-16 04:35:59,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 04:35:59,924 INFO L413 NwaCegarLoop]: 105 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, 105 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 04:35:59,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-16 04:35:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-12-16 04:35:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.253968253968254) internal successors, (79), 71 states have internal predecessors, (79), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:35:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2023-12-16 04:35:59,970 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 14 [2023-12-16 04:35:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:59,970 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2023-12-16 04:35:59,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:35:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2023-12-16 04:35:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 04:35:59,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:59,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 04:35:59,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:35:59,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:59,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1538349061, now seen corresponding path program 1 times [2023-12-16 04:35:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:59,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758883344] [2023-12-16 04:35:59,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:36:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:00,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 04:36:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:00,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:36:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 04:36:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758883344] [2023-12-16 04:36:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758883344] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856230222] [2023-12-16 04:36:00,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:00,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:00,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:00,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:36:00,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:36:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:01,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-16 04:36:01,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:01,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 04:36:01,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:36:01,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-16 04:36:01,341 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 16 treesize of output 8 [2023-12-16 04:36:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:36:01,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:01,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-12-16 04:36:01,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-16 04:36:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 04:36:01,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856230222] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:36:01,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:36:01,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 15 [2023-12-16 04:36:01,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91012795] [2023-12-16 04:36:01,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:36:01,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:36:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:36:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:36:01,487 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 04:36:05,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:09,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:13,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:17,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:21,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:25,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:26,150 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2023-12-16 04:36:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:36:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2023-12-16 04:36:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:26,153 INFO L225 Difference]: With dead ends: 109 [2023-12-16 04:36:26,153 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 04:36:26,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2023-12-16 04:36:26,154 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 190 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 45 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:26,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 385 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 608 Invalid, 6 Unknown, 0 Unchecked, 24.4s Time] [2023-12-16 04:36:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 04:36:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2023-12-16 04:36:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 85 states have internal predecessors, (96), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:36:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2023-12-16 04:36:26,173 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 32 [2023-12-16 04:36:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:26,174 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2023-12-16 04:36:26,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 04:36:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2023-12-16 04:36:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 04:36:26,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:26,175 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:26,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 04:36:26,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:26,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:26,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash 877821295, now seen corresponding path program 1 times [2023-12-16 04:36:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:26,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770916379] [2023-12-16 04:36:26,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:26,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:36:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 04:36:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:36:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 04:36:26,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:26,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770916379] [2023-12-16 04:36:26,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770916379] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:26,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280192430] [2023-12-16 04:36:26,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:26,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:26,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:26,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:36:26,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:36:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:26,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 04:36:26,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:26,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 04:36:27,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:36:27,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-16 04:36:27,147 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 16 treesize of output 8 [2023-12-16 04:36:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:36:27,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:27,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-12-16 04:36:27,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-16 04:36:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 04:36:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280192430] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:36:27,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:36:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 15 [2023-12-16 04:36:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542573002] [2023-12-16 04:36:27,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:36:27,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:36:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:27,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:36:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:36:27,259 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 15 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 04:36:31,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:35,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:39,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:43,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:47,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:36:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:47,884 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2023-12-16 04:36:47,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:36:47,885 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2023-12-16 04:36:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:47,886 INFO L225 Difference]: With dead ends: 112 [2023-12-16 04:36:47,886 INFO L226 Difference]: Without dead ends: 109 [2023-12-16 04:36:47,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2023-12-16 04:36:47,887 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 230 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 49 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:47,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 411 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 668 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2023-12-16 04:36:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-16 04:36:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2023-12-16 04:36:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.225) internal successors, (98), 88 states have internal predecessors, (98), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:36:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2023-12-16 04:36:47,922 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 34 [2023-12-16 04:36:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:47,923 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2023-12-16 04:36:47,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 04:36:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2023-12-16 04:36:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 04:36:47,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:47,924 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:47,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:36:48,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-16 04:36:48,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:48,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash 822846683, now seen corresponding path program 1 times [2023-12-16 04:36:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:48,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72418518] [2023-12-16 04:36:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:36:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:48,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 04:36:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:36:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:36:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72418518] [2023-12-16 04:36:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72418518] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220152285] [2023-12-16 04:36:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:49,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:49,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:49,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:36:49,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:36:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:49,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-16 04:36:49,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:49,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 04:36:49,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:36:49,488 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 04:36:49,498 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 36 treesize of output 37 [2023-12-16 04:36:49,536 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-16 04:36:49,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2023-12-16 04:36:49,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 20 [2023-12-16 04:36:49,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:36:49,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:36:49,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-12-16 04:36:49,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-12-16 04:36:49,738 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 16 treesize of output 4 [2023-12-16 04:36:49,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-16 04:36:49,776 WARN L876 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#3.base)| |chain_node_~node~0#1.base| (select |c_#memory_$Pointer$#3.base| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$#3.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2023-12-16 04:36:49,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:36:49,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-12-16 04:36:49,790 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-16 04:36:49,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-12-16 04:36:49,825 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 04:36:49,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-16 04:36:49,838 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 16 treesize of output 8 [2023-12-16 04:36:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-16 04:36:49,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:49,887 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (|v_chain_node_~node~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_28|) 0)) (not (= (select (select (store |c_#memory_$Pointer$#3.base| |v_chain_node_~node~0#1.base_28| v_ArrVal_810) (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) 0)))) is different from false [2023-12-16 04:36:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220152285] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:49,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:36:49,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 27 [2023-12-16 04:36:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890030202] [2023-12-16 04:36:49,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:36:49,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 04:36:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 04:36:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=582, Unknown=2, NotChecked=98, Total=756 [2023-12-16 04:36:49,893 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand has 27 states, 17 states have (on average 2.764705882352941) internal successors, (47), 22 states have internal predecessors, (47), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 04:36:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:50,898 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2023-12-16 04:36:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:36:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 17 states have (on average 2.764705882352941) internal successors, (47), 22 states have internal predecessors, (47), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-12-16 04:36:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:50,900 INFO L225 Difference]: With dead ends: 175 [2023-12-16 04:36:50,900 INFO L226 Difference]: Without dead ends: 172 [2023-12-16 04:36:50,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=1172, Unknown=2, NotChecked=142, Total=1482 [2023-12-16 04:36:50,901 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 265 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:50,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 598 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1294 Invalid, 0 Unknown, 189 Unchecked, 0.7s Time] [2023-12-16 04:36:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-16 04:36:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2023-12-16 04:36:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 107 states have internal predecessors, (120), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 04:36:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2023-12-16 04:36:50,930 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 38 [2023-12-16 04:36:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:50,930 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2023-12-16 04:36:50,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 17 states have (on average 2.764705882352941) internal successors, (47), 22 states have internal predecessors, (47), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 04:36:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2023-12-16 04:36:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 04:36:50,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:50,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:50,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:36:51,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:51,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:51,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1779369084, now seen corresponding path program 1 times [2023-12-16 04:36:51,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:51,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109457603] [2023-12-16 04:36:51,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:36:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 04:36:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:36:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:52,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-16 04:36:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:36:52,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109457603] [2023-12-16 04:36:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109457603] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467258329] [2023-12-16 04:36:52,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:52,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:52,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:52,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:36:52,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:36:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:52,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 129 conjunts are in the unsatisfiable core [2023-12-16 04:36:52,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:52,703 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 11 treesize of output 7 [2023-12-16 04:36:52,789 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 7 treesize of output 3 [2023-12-16 04:36:52,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:36:52,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:36:52,929 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 04:36:52,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2023-12-16 04:36:52,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-16 04:36:52,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-16 04:36:53,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:36:53,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-12-16 04:36:53,130 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 11 treesize of output 7 [2023-12-16 04:36:53,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-16 04:36:53,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-16 04:36:53,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-16 04:36:53,287 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_8| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_8|) 0))) (exists ((|chain_node_~node~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#3.base)| |chain_node_~node~0#1.base| (select |c_#memory_$Pointer$#3.base| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$#3.base|) (= (store |c_old(#memory_$Pointer$#3.offset)| |chain_node_~node~0#1.base| (select |c_#memory_$Pointer$#3.offset| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$#3.offset|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_12|) 0) 0)) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2023-12-16 04:36:53,309 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-16 04:36:53,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-12-16 04:36:53,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 04:36:53,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-16 04:36:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-16 04:36:53,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467258329] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:54,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:36:54,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 34 [2023-12-16 04:36:54,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750072709] [2023-12-16 04:36:54,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:36:54,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-16 04:36:54,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:54,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-16 04:36:54,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1406, Unknown=1, NotChecked=76, Total=1640 [2023-12-16 04:36:54,452 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand has 34 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 30 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:36:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:57,875 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2023-12-16 04:36:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-16 04:36:57,876 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 30 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 42 [2023-12-16 04:36:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:57,878 INFO L225 Difference]: With dead ends: 266 [2023-12-16 04:36:57,878 INFO L226 Difference]: Without dead ends: 263 [2023-12-16 04:36:57,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=476, Invalid=3949, Unknown=1, NotChecked=130, Total=4556 [2023-12-16 04:36:57,879 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 496 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:57,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 580 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1539 Invalid, 0 Unknown, 286 Unchecked, 2.0s Time] [2023-12-16 04:36:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-12-16 04:36:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 128. [2023-12-16 04:36:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 109 states have internal predecessors, (123), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 04:36:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2023-12-16 04:36:57,910 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 42 [2023-12-16 04:36:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:57,910 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2023-12-16 04:36:57,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 30 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 04:36:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2023-12-16 04:36:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 04:36:57,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:57,911 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 04:36:57,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-16 04:36:58,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:58,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:58,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2133715017, now seen corresponding path program 1 times [2023-12-16 04:36:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:58,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922992989] [2023-12-16 04:36:58,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:58,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:36:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 04:36:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:36:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:36:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922992989] [2023-12-16 04:36:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922992989] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:59,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308728962] [2023-12-16 04:36:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:59,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:59,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:59,289 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:36:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:36:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:59,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 129 conjunts are in the unsatisfiable core [2023-12-16 04:36:59,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:59,565 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 11 treesize of output 7 [2023-12-16 04:36:59,569 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 04:36:59,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:36:59,685 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 11 treesize of output 7 [2023-12-16 04:36:59,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:36:59,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:36:59,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2023-12-16 04:36:59,837 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 16 treesize of output 1 [2023-12-16 04:36:59,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2023-12-16 04:36:59,874 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-16 04:36:59,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2023-12-16 04:36:59,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-12-16 04:36:59,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 23 [2023-12-16 04:37:00,070 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 59 treesize of output 43 [2023-12-16 04:37:00,073 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 50 treesize of output 38 [2023-12-16 04:37:00,080 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 04:37:00,086 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 04:37:00,136 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 7 [2023-12-16 04:37:00,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2023-12-16 04:37:00,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-16 04:37:00,235 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|chain_node_~node~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#3.base)| |chain_node_~node~0#1.base| (select |c_#memory_$Pointer$#3.base| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$#3.base|) (= (store |c_old(#memory_$Pointer$#3.offset)| |chain_node_~node~0#1.base| (select |c_#memory_$Pointer$#3.offset| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$#3.offset|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_12| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_12|) 0) 0)) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_11|) 0) 0))) is different from true [2023-12-16 04:37:00,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:37:00,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-12-16 04:37:00,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:37:00,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-16 04:37:00,263 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-16 04:37:00,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-12-16 04:37:00,372 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 04:37:00,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-12-16 04:37:00,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 04:37:00,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 04:37:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-16 04:37:00,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:37:00,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308728962] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:37:00,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:37:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 34 [2023-12-16 04:37:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430710510] [2023-12-16 04:37:00,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:37:00,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-16 04:37:00,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:37:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-16 04:37:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1034, Unknown=1, NotChecked=64, Total=1190 [2023-12-16 04:37:00,680 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 34 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 29 states have internal predecessors, (62), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 04:37:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:37:02,658 INFO L93 Difference]: Finished difference Result 291 states and 348 transitions. [2023-12-16 04:37:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 04:37:02,659 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 29 states have internal predecessors, (62), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-12-16 04:37:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:37:02,660 INFO L225 Difference]: With dead ends: 291 [2023-12-16 04:37:02,660 INFO L226 Difference]: Without dead ends: 221 [2023-12-16 04:37:02,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=231, Invalid=2322, Unknown=1, NotChecked=98, Total=2652 [2023-12-16 04:37:02,662 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 332 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:37:02,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 605 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1464 Invalid, 0 Unknown, 210 Unchecked, 1.3s Time] [2023-12-16 04:37:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-16 04:37:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 158. [2023-12-16 04:37:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.1951219512195121) internal successors, (147), 134 states have internal predecessors, (147), 24 states have call successors, (24), 11 states have call predecessors, (24), 10 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:37:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2023-12-16 04:37:02,717 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 42 [2023-12-16 04:37:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:37:02,718 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2023-12-16 04:37:02,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 29 states have internal predecessors, (62), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 04:37:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2023-12-16 04:37:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 04:37:02,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:37:02,722 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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 04:37:02,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-16 04:37:02,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:37:02,928 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:37:02,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:37:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1367321695, now seen corresponding path program 1 times [2023-12-16 04:37:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:37:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181133762] [2023-12-16 04:37:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:37:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:37:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:37:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:37:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:37:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 04:37:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:37:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:37:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:37:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 04:37:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:37:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 04:37:04,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:37:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181133762] [2023-12-16 04:37:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181133762] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:37:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332613008] [2023-12-16 04:37:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:37:04,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:37:04,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:37:04,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:37:04,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:37:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:37:04,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 99 conjunts are in the unsatisfiable core [2023-12-16 04:37:04,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:37:04,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 04:37:04,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:37:04,713 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 36 treesize of output 37 [2023-12-16 04:37:04,734 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-16 04:37:04,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2023-12-16 04:37:04,740 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 04:37:04,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 20 [2023-12-16 04:37:04,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:37:04,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:37:04,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-12-16 04:37:04,881 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 28 treesize of output 20 [2023-12-16 04:37:04,911 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 16 treesize of output 4 [2023-12-16 04:37:04,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-16 04:37:04,976 WARN L876 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| (select |c_#valid| |chain_node_~node~0#1.base|))) (= (store |c_old(#memory_$Pointer$#3.base)| |chain_node_~node~0#1.base| (select |c_#memory_$Pointer$#3.base| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$#3.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2023-12-16 04:37:04,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:37:04,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-12-16 04:37:04,997 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-12-16 04:37:04,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-12-16 04:37:05,012 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 16 treesize of output 4 [2023-12-16 04:37:05,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-16 04:37:05,050 WARN L876 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#3.base)| |chain_node_~node~0#1.base| (select |c_#memory_$Pointer$#3.base| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$#3.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2023-12-16 04:37:05,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:37:05,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-12-16 04:37:05,063 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-16 04:37:05,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-12-16 04:37:05,101 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 04:37:05,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-16 04:37:05,113 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 16 treesize of output 8 [2023-12-16 04:37:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2023-12-16 04:37:05,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:37:05,166 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.base_37| Int) (v_ArrVal_1737 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#3.base| |v_chain_node_~node~0#1.base_37| v_ArrVal_1737) (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) 0)) (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_37|) 0)))) is different from false [2023-12-16 04:37:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332613008] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:37:05,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:37:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 34 [2023-12-16 04:37:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100578281] [2023-12-16 04:37:05,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:37:05,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-16 04:37:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:37:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-16 04:37:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=905, Unknown=3, NotChecked=186, Total=1190 [2023-12-16 04:37:05,170 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand has 34 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 29 states have internal predecessors, (59), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-16 04:37:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:37:06,304 INFO L93 Difference]: Finished difference Result 203 states and 243 transitions. [2023-12-16 04:37:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 04:37:06,304 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 29 states have internal predecessors, (59), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 45 [2023-12-16 04:37:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:37:06,306 INFO L225 Difference]: With dead ends: 203 [2023-12-16 04:37:06,306 INFO L226 Difference]: Without dead ends: 200 [2023-12-16 04:37:06,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=1543, Unknown=3, NotChecked=246, Total=1980 [2023-12-16 04:37:06,307 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 290 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:37:06,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 785 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1581 Invalid, 0 Unknown, 330 Unchecked, 0.8s Time] [2023-12-16 04:37:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-16 04:37:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 160. [2023-12-16 04:37:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 125 states have (on average 1.2) internal successors, (150), 136 states have internal predecessors, (150), 24 states have call successors, (24), 11 states have call predecessors, (24), 10 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:37:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2023-12-16 04:37:06,334 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 45 [2023-12-16 04:37:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:37:06,335 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2023-12-16 04:37:06,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 29 states have internal predecessors, (59), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-16 04:37:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2023-12-16 04:37:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 04:37:06,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:37:06,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:37:06,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:37:06,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:37:06,542 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:37:06,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:37:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash 651148237, now seen corresponding path program 1 times [2023-12-16 04:37:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:37:06,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979476930] [2023-12-16 04:37:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:37:06,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:37:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 04:37:07,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:37:07,527 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-16 04:37:07,530 INFO L158 Benchmark]: Toolchain (without parser) took 68928.10ms. Allocated memory was 173.0MB in the beginning and 415.2MB in the end (delta: 242.2MB). Free memory was 140.2MB in the beginning and 219.5MB in the end (delta: -79.3MB). Peak memory consumption was 255.3MB. Max. memory is 8.0GB. [2023-12-16 04:37:07,530 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory was 123.2MB in the beginning and 123.1MB in the end (delta: 88.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:37:07,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.82ms. Allocated memory was 173.0MB in the beginning and 240.1MB in the end (delta: 67.1MB). Free memory was 140.0MB in the beginning and 192.5MB in the end (delta: -52.5MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. [2023-12-16 04:37:07,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 240.1MB. Free memory was 192.5MB in the beginning and 189.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:37:07,531 INFO L158 Benchmark]: Boogie Preprocessor took 62.05ms. Allocated memory is still 240.1MB. Free memory was 189.8MB in the beginning and 185.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:37:07,531 INFO L158 Benchmark]: RCFGBuilder took 491.72ms. Allocated memory is still 240.1MB. Free memory was 185.1MB in the beginning and 157.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-16 04:37:07,531 INFO L158 Benchmark]: TraceAbstraction took 67926.80ms. Allocated memory was 240.1MB in the beginning and 415.2MB in the end (delta: 175.1MB). Free memory was 156.8MB in the beginning and 219.5MB in the end (delta: -62.7MB). Peak memory consumption was 204.2MB. Max. memory is 8.0GB. [2023-12-16 04:37:07,532 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.10ms. Allocated memory is still 173.0MB. Free memory was 123.2MB in the beginning and 123.1MB in the end (delta: 88.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 396.82ms. Allocated memory was 173.0MB in the beginning and 240.1MB in the end (delta: 67.1MB). Free memory was 140.0MB in the beginning and 192.5MB in the end (delta: -52.5MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 240.1MB. Free memory was 192.5MB in the beginning and 189.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.05ms. Allocated memory is still 240.1MB. Free memory was 189.8MB in the beginning and 185.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 491.72ms. Allocated memory is still 240.1MB. Free memory was 185.1MB in the beginning and 157.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 67926.80ms. Allocated memory was 240.1MB in the beginning and 415.2MB in the end (delta: 175.1MB). Free memory was 156.8MB in the beginning and 219.5MB in the end (delta: -62.7MB). Peak memory consumption was 204.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown