/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/bubble_sort_linux-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:35:36,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:35:36,525 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:36,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:35:36,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:35:36,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:35:36,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:35:36,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:35:36,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:35:36,572 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:35:36,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:35:36,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:35:36,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:35:36,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:35:36,574 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:35:36,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:35:36,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:35:36,575 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:35:36,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:35:36,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:35:36,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:35:36,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:35:36,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:35:36,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:35:36,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:35:36,577 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:35:36,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:35:36,578 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:35:36,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:35:36,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:35:36,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:35:36,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:35:36,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:35:36,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:35:36,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:35:36,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:35:36,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:35:36,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:35:36,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:35:36,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:35:36,581 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:35:36,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:35:36,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:35:36,581 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:36,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:35:36,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:35:36,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:35:36,841 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:35:36,841 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:35:36,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i [2023-12-16 04:35:38,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:35:38,357 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:35:38,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i [2023-12-16 04:35:38,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87abf5411/2dd045759ddb492791cb72bc533e68b9/FLAG86656cf97 [2023-12-16 04:35:38,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87abf5411/2dd045759ddb492791cb72bc533e68b9 [2023-12-16 04:35:38,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:35:38,404 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:35:38,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:35:38,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:35:38,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:35:38,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:35:38" (1/1) ... [2023-12-16 04:35:38,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9fc3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:38, skipping insertion in model container [2023-12-16 04:35:38,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:35:38" (1/1) ... [2023-12-16 04:35:38,466 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:35:38,829 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/bubble_sort_linux-2.i[33822,33835] [2023-12-16 04:35:38,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:35:38,881 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:35:38,917 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/bubble_sort_linux-2.i[33822,33835] [2023-12-16 04:35:38,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:35:38,974 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:35:38,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:38 WrapperNode [2023-12-16 04:35:38,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:35:38,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:35:38,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:35:38,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:35:38,982 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:38" (1/1) ... [2023-12-16 04:35:39,018 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:38" (1/1) ... [2023-12-16 04:35:39,044 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2023-12-16 04:35:39,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:35:39,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:35:39,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:35:39,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:35:39,057 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:38" (1/1) ... [2023-12-16 04:35:39,057 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:38" (1/1) ... [2023-12-16 04:35:39,080 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:38" (1/1) ... [2023-12-16 04:35:39,109 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2023-12-16 04:35:39,110 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:38" (1/1) ... [2023-12-16 04:35:39,110 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:38" (1/1) ... [2023-12-16 04:35:39,126 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:38" (1/1) ... [2023-12-16 04:35:39,132 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:38" (1/1) ... [2023-12-16 04:35:39,134 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:38" (1/1) ... [2023-12-16 04:35:39,135 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:38" (1/1) ... [2023-12-16 04:35:39,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:35:39,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:35:39,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:35:39,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:35:39,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:38" (1/1) ... [2023-12-16 04:35:39,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:35:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:35:39,170 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:39,174 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:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:35:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:35:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-12-16 04:35:39,193 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-12-16 04:35:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:35:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 04:35:39,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 04:35:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-12-16 04:35:39,194 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-12-16 04:35:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:35:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:35:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-16 04:35:39,194 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-16 04:35:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:35:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:35:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:35:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:35:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:35:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:35:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-16 04:35:39,195 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-16 04:35:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:35:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:35:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:35:39,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:35:39,327 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:35:39,329 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:35:39,697 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:35:39,738 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:35:39,738 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-12-16 04:35:39,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:35:39 BoogieIcfgContainer [2023-12-16 04:35:39,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:35:39,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:35:39,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:35:39,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:35:39,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:35:38" (1/3) ... [2023-12-16 04:35:39,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ad4937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:35:39, skipping insertion in model container [2023-12-16 04:35:39,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:35:38" (2/3) ... [2023-12-16 04:35:39,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ad4937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:35:39, skipping insertion in model container [2023-12-16 04:35:39,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:35:39" (3/3) ... [2023-12-16 04:35:39,745 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-12-16 04:35:39,759 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:35:39,760 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:35:39,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:35:39,809 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;@5c2af34a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:35:39,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:35:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-16 04:35:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 04:35:39,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:39,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:39,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:39,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-12-16 04:35:39,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:39,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100462902] [2023-12-16 04:35:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:39,982 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:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100462902] [2023-12-16 04:35:39,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100462902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:39,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:39,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:35:39,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930534800] [2023-12-16 04:35:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:39,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:35:39,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:35:40,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:35:40,021 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:40,091 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-12-16 04:35:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:35:40,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 8 [2023-12-16 04:35:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:40,102 INFO L225 Difference]: With dead ends: 210 [2023-12-16 04:35:40,103 INFO L226 Difference]: Without dead ends: 99 [2023-12-16 04:35:40,107 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:40,111 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:40,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:35:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-16 04:35:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-16 04:35:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 04:35:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-12-16 04:35:40,148 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-12-16 04:35:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:40,148 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-12-16 04:35:40,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-12-16 04:35:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:35:40,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:40,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:40,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:35:40,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:40,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-12-16 04:35:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672601154] [2023-12-16 04:35:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:40,413 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:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672601154] [2023-12-16 04:35:40,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672601154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:40,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:40,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:35:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297197991] [2023-12-16 04:35:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:40,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:35:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:35:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:35:40,417 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:40,796 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-12-16 04:35:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:35:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-12-16 04:35:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:40,798 INFO L225 Difference]: With dead ends: 101 [2023-12-16 04:35:40,799 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 04:35:40,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:35:40,800 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 233 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:40,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 87 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:35:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 04:35:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-16 04:35:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 04:35:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-12-16 04:35:40,820 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-12-16 04:35:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:40,821 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-12-16 04:35:40,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-12-16 04:35:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 04:35:40,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:40,823 INFO L195 NwaCegarLoop]: trace histogram [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:40,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:35:40,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:40,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:40,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-12-16 04:35:40,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:40,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116989530] [2023-12-16 04:35:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:40,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:41,444 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:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:41,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116989530] [2023-12-16 04:35:41,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116989530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:41,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:35:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456720609] [2023-12-16 04:35:41,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:41,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:35:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:41,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:35:41,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:35:41,459 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:42,448 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-12-16 04:35:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:35:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-12-16 04:35:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:42,455 INFO L225 Difference]: With dead ends: 187 [2023-12-16 04:35:42,455 INFO L226 Difference]: Without dead ends: 181 [2023-12-16 04:35:42,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:35:42,460 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 462 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:42,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 122 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:35:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-16 04:35:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2023-12-16 04:35:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 04:35:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-12-16 04:35:42,505 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2023-12-16 04:35:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:42,505 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-12-16 04:35:42,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-12-16 04:35:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 04:35:42,506 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:42,506 INFO L195 NwaCegarLoop]: trace histogram [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:42,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:35:42,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:42,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-12-16 04:35:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:42,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902592994] [2023-12-16 04:35:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:43,516 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:43,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:43,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902592994] [2023-12-16 04:35:43,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902592994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:43,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:43,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:35:43,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388847447] [2023-12-16 04:35:43,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:43,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:35:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:43,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:35:43,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:35:43,519 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:44,431 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2023-12-16 04:35:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:35:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-16 04:35:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:44,435 INFO L225 Difference]: With dead ends: 259 [2023-12-16 04:35:44,435 INFO L226 Difference]: Without dead ends: 256 [2023-12-16 04:35:44,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:35:44,440 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 305 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:44,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 160 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:35:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-16 04:35:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2023-12-16 04:35:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 218 states have internal predecessors, (255), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:35:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 294 transitions. [2023-12-16 04:35:44,482 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 294 transitions. Word has length 23 [2023-12-16 04:35:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:44,483 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 294 transitions. [2023-12-16 04:35:44,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2023-12-16 04:35:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 04:35:44,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:44,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:44,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:35:44,484 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:44,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-12-16 04:35:44,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:44,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604793940] [2023-12-16 04:35:44,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:45,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:45,169 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:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604793940] [2023-12-16 04:35:45,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604793940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:45,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:45,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:35:45,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289603716] [2023-12-16 04:35:45,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:45,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:35:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:45,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:35:45,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:35:45,173 INFO L87 Difference]: Start difference. First operand 238 states and 294 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:46,121 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2023-12-16 04:35:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:35:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-12-16 04:35:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:46,125 INFO L225 Difference]: With dead ends: 258 [2023-12-16 04:35:46,125 INFO L226 Difference]: Without dead ends: 255 [2023-12-16 04:35:46,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:35:46,127 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:46,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 189 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:35:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-16 04:35:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2023-12-16 04:35:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.251231527093596) internal successors, (254), 218 states have internal predecessors, (254), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:35:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2023-12-16 04:35:46,160 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 26 [2023-12-16 04:35:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:46,160 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2023-12-16 04:35:46,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2023-12-16 04:35:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:35:46,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:46,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:46,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:35:46,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:46,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:46,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-12-16 04:35:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030262175] [2023-12-16 04:35:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:46,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:47,070 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:47,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:47,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030262175] [2023-12-16 04:35:47,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030262175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:47,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:47,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:35:47,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258634218] [2023-12-16 04:35:47,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:47,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:35:47,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:47,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:35:47,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:35:47,072 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:47,982 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2023-12-16 04:35:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:35:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-12-16 04:35:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:47,984 INFO L225 Difference]: With dead ends: 257 [2023-12-16 04:35:47,984 INFO L226 Difference]: Without dead ends: 254 [2023-12-16 04:35:47,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:35:47,985 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 332 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:47,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 176 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:35:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-16 04:35:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2023-12-16 04:35:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 218 states have internal predecessors, (253), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:35:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2023-12-16 04:35:48,018 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 29 [2023-12-16 04:35:48,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:48,018 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2023-12-16 04:35:48,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2023-12-16 04:35:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 04:35:48,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:48,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:48,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:35:48,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:48,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-12-16 04:35:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:48,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854496154] [2023-12-16 04:35:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:48,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:48,909 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:48,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854496154] [2023-12-16 04:35:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854496154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:48,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:48,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:35:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68560723] [2023-12-16 04:35:48,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:48,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:35:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:35:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:35:48,911 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:49,809 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2023-12-16 04:35:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:35:49,810 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-12-16 04:35:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:49,811 INFO L225 Difference]: With dead ends: 256 [2023-12-16 04:35:49,812 INFO L226 Difference]: Without dead ends: 253 [2023-12-16 04:35:49,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:35:49,813 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 325 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:49,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 173 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:35:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-16 04:35:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2023-12-16 04:35:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:35:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2023-12-16 04:35:49,845 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 32 [2023-12-16 04:35:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:49,846 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2023-12-16 04:35:49,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2023-12-16 04:35:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 04:35:49,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:49,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:49,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:35:49,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:49,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-12-16 04:35:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525183591] [2023-12-16 04:35:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:35:50,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525183591] [2023-12-16 04:35:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525183591] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:35:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639735300] [2023-12-16 04:35:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:35:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:35:50,933 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:35:50,943 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:35:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:51,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-16 04:35:51,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:35:51,202 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-16 04:35:51,203 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 19 treesize of output 16 [2023-12-16 04:35:51,246 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 16 treesize of output 11 [2023-12-16 04:35:51,256 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 16 treesize of output 11 [2023-12-16 04:35:51,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-16 04:35:51,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:51,569 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 36 treesize of output 17 [2023-12-16 04:35:51,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-12-16 04:35:51,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-16 04:35:51,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:51,588 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 36 treesize of output 19 [2023-12-16 04:35:51,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 11 [2023-12-16 04:35:51,653 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:35:51,653 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-12-16 04:35:51,657 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 11 [2023-12-16 04:35:51,729 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:35:51,729 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 11 treesize of output 11 [2023-12-16 04:35:51,782 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 16 treesize of output 11 [2023-12-16 04:35:51,787 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 17 treesize of output 12 [2023-12-16 04:35:51,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2023-12-16 04:35:51,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:51,902 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-12-16 04:35:51,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2023-12-16 04:35:51,907 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 26 treesize of output 14 [2023-12-16 04:35:51,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-12-16 04:35:51,985 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 23 treesize of output 16 [2023-12-16 04:35:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:35:52,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:35:52,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639735300] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:35:52,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:35:52,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2023-12-16 04:35:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277945447] [2023-12-16 04:35:52,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:35:52,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 04:35:52,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 04:35:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=751, Unknown=6, NotChecked=0, Total=870 [2023-12-16 04:35:52,417 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 04:35:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:54,291 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2023-12-16 04:35:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:35:54,291 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-12-16 04:35:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:54,293 INFO L225 Difference]: With dead ends: 258 [2023-12-16 04:35:54,293 INFO L226 Difference]: Without dead ends: 255 [2023-12-16 04:35:54,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=1304, Unknown=11, NotChecked=0, Total=1560 [2023-12-16 04:35:54,294 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 718 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 169 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:54,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 154 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1400 Invalid, 2 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 04:35:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-16 04:35:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2023-12-16 04:35:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2352941176470589) internal successors, (252), 219 states have internal predecessors, (252), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:35:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2023-12-16 04:35:54,331 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 33 [2023-12-16 04:35:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:54,332 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2023-12-16 04:35:54,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 04:35:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2023-12-16 04:35:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 04:35:54,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:54,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:54,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:35:54,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:35:54,544 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:54,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1581408063, now seen corresponding path program 1 times [2023-12-16 04:35:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463263652] [2023-12-16 04:35:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:55,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:55,129 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:55,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:55,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463263652] [2023-12-16 04:35:55,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463263652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:35:55,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:35:55,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:35:55,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172809016] [2023-12-16 04:35:55,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:35:55,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:35:55,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:35:55,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:35:55,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:35:55,132 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:35:56,086 INFO L93 Difference]: Finished difference Result 257 states and 306 transitions. [2023-12-16 04:35:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:35:56,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-12-16 04:35:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:35:56,088 INFO L225 Difference]: With dead ends: 257 [2023-12-16 04:35:56,088 INFO L226 Difference]: Without dead ends: 254 [2023-12-16 04:35:56,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-12-16 04:35:56,089 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 398 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:35:56,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 163 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:35:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-16 04:35:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-12-16 04:35:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2303921568627452) internal successors, (251), 219 states have internal predecessors, (251), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:35:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 290 transitions. [2023-12-16 04:35:56,124 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 290 transitions. Word has length 35 [2023-12-16 04:35:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:35:56,124 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 290 transitions. [2023-12-16 04:35:56,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:35:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 290 transitions. [2023-12-16 04:35:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 04:35:56,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:35:56,125 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:35:56,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:35:56,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:35:56,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:35:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1738679921, now seen corresponding path program 1 times [2023-12-16 04:35:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:35:56,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003019945] [2023-12-16 04:35:56,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:35:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:35:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:35:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:35:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:35:57,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003019945] [2023-12-16 04:35:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003019945] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:35:57,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344943566] [2023-12-16 04:35:57,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:35:57,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:35:57,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:35:57,405 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:35:57,425 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:35:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:35:57,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-16 04:35:57,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:35:57,599 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-16 04:35:57,600 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 19 treesize of output 16 [2023-12-16 04:35:57,632 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 23 treesize of output 16 [2023-12-16 04:35:57,684 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2023-12-16 04:35:57,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:57,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2023-12-16 04:35:57,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2023-12-16 04:35:57,697 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 7 treesize of output 3 [2023-12-16 04:35:57,715 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-16 04:35:57,716 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 88 [2023-12-16 04:35:57,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:57,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-12-16 04:35:57,748 INFO L349 Elim1Store]: treesize reduction 20, result has 54.5 percent of original size [2023-12-16 04:35:57,748 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 33 treesize of output 51 [2023-12-16 04:35:57,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 97 [2023-12-16 04:35:57,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:57,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2023-12-16 04:35:57,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2023-12-16 04:35:57,812 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-16 04:35:57,812 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 81 [2023-12-16 04:35:57,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:35:57,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-12-16 04:35:57,822 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 16 treesize of output 15 [2023-12-16 04:35:57,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:35:57,833 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 17 treesize of output 21 [2023-12-16 04:35:57,848 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2023-12-16 04:35:57,851 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:35:57,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2023-12-16 04:35:57,859 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 63 treesize of output 59 [2023-12-16 04:35:57,869 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 12 treesize of output 1 [2023-12-16 04:35:58,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 159 [2023-12-16 04:35:58,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:58,122 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:35:58,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 57 treesize of output 56 [2023-12-16 04:35:58,163 INFO L349 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-12-16 04:35:58,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2023-12-16 04:35:58,179 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 04:35:58,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-12-16 04:35:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:58,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:58,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2023-12-16 04:35:58,419 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 103 treesize of output 98 [2023-12-16 04:35:58,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:58,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2023-12-16 04:35:58,439 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-16 04:35:58,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2023-12-16 04:35:58,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2023-12-16 04:35:58,553 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:35:58,555 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 11 treesize of output 11 [2023-12-16 04:35:58,607 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 32 treesize of output 25 [2023-12-16 04:35:58,613 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:35:58,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 172 [2023-12-16 04:35:58,906 INFO L349 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2023-12-16 04:35:58,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 198 [2023-12-16 04:35:58,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:58,972 INFO L349 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2023-12-16 04:35:58,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 118 [2023-12-16 04:35:58,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2023-12-16 04:35:59,006 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 7 treesize of output 3 [2023-12-16 04:35:59,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 31 [2023-12-16 04:35:59,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:35:59,937 INFO L349 Elim1Store]: treesize reduction 286, result has 19.4 percent of original size [2023-12-16 04:35:59,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1054 treesize of output 1005 [2023-12-16 04:36:00,077 INFO L349 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2023-12-16 04:36:00,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 336 [2023-12-16 04:36:00,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:36:00,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-12-16 04:36:00,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 179 [2023-12-16 04:36:00,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:36:00,692 INFO L349 Elim1Store]: treesize reduction 286, result has 19.4 percent of original size [2023-12-16 04:36:00,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1034 treesize of output 985 [2023-12-16 04:36:00,845 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-16 04:36:00,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 296 [2023-12-16 04:36:00,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:36:00,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-12-16 04:36:00,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 168 [2023-12-16 04:36:01,263 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse7 (= 3 (select .cse6 4))) (.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| 3) 4) 4)) (.cse13 (select .cse6 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (or (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 Int) (v_prenex_163 Int) (v_DerPreprocessor_10 Int)) (let ((.cse5 (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_19) v_DerPreprocessor_18 v_DerPreprocessor_20) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_21) 3 .cse6))) (let ((.cse1 (select .cse5 v_DerPreprocessor_10)) (.cse0 (+ v_prenex_163 4))) (let ((.cse3 (select (store .cse1 .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (let ((.cse2 (select .cse5 .cse3))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse0) 4) (= .cse1 v_DerPreprocessor_19) (= v_DerPreprocessor_20 .cse2) (= (select |c_#memory_$Pointer$#1.base| .cse3) .cse2) (not (= v_DerPreprocessor_10 3)) (= v_DerPreprocessor_18 .cse3) (= .cse4 (select .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)))))))) .cse7) (and .cse8 (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse11 (select (select .cse10 3) 0))) (let ((.cse12 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse9 (store (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse10 .cse11) (store (select |c_#memory_$Pointer$#1.base| .cse11) (+ 4 v_arrayElimCell_71) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_16 (store .cse12 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse10 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse11) (= (store .cse12 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse11) (= (select .cse9 .cse11) v_DerPreprocessor_14))))))) (and (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse16 (select (select .cse15 3) 0))) (let ((.cse17 (+ 4 v_arrayElimCell_71)) (.cse18 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse14 (store (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse15 .cse16) (store (select |c_#memory_$Pointer$#1.base| .cse16) .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_16 (store .cse18 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17) 4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse16) (= (store .cse18 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse16) (= (select .cse14 .cse16) v_DerPreprocessor_14)))))) .cse8) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse19 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse23 (select .cse21 3))) (let ((.cse22 (select .cse23 0))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.base| .cse22 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select (select .cse21 .cse22) (+ 4 v_arrayElimCell_71))) (= v_DerPreprocessor_11 (select .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse23 4) 3) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse22) (= v_DerPreprocessor_10 .cse22) (= (select .cse20 .cse22) v_DerPreprocessor_14))))))))) (= (store .cse19 0 .cse13) .cse6)))) (and (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_23) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_24) 3 .cse6)) (.cse25 (+ 4 v_arrayElimCell_71))) (and (= (select .cse24 v_DerPreprocessor_10) (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10)) (= 4 (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse25)) (not (= v_DerPreprocessor_10 3)) (= (select .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)) (not (= .cse25 0))))) .cse7) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse26 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse30 (select .cse28 3))) (let ((.cse29 (select .cse30 0))) (let ((.cse27 (store (store (store |c_#memory_$Pointer$#1.base| .cse29 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse28 .cse29) (store (select |c_#memory_$Pointer$#1.base| .cse29) (+ 4 v_arrayElimCell_71) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_11 (select .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse30 4) 3) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse29) (= v_DerPreprocessor_10 .cse29) (= (select .cse27 .cse29) v_DerPreprocessor_14))))))))) (= (store .cse26 0 .cse13) .cse6)))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse31 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse36 (select .cse33 3))) (let ((.cse34 (select .cse36 0))) (let ((.cse35 (+ 4 v_arrayElimCell_71)) (.cse32 (store (store (store |c_#memory_$Pointer$#1.base| .cse34 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse32 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse33 .cse34) (store (select |c_#memory_$Pointer$#1.base| .cse34) .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_11 (select .cse33 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse36 4) 3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse34) .cse35) 4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse34) (= v_DerPreprocessor_10 .cse34) (= (select .cse32 .cse34) v_DerPreprocessor_14))))))))) (= (store .cse31 0 .cse13) .cse6)))) (and .cse8 (or (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimCell_71 Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_10 Int)) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_28) v_DerPreprocessor_27 v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_30) 3 .cse6))) (let ((.cse37 (select .cse41 v_DerPreprocessor_10)) (.cse40 (+ 4 v_arrayElimCell_71))) (let ((.cse39 (select (store .cse37 .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (let ((.cse38 (select .cse41 .cse39))) (and (= v_DerPreprocessor_28 .cse37) (= v_DerPreprocessor_29 .cse38) (= v_DerPreprocessor_27 .cse39) (= .cse38 (select |c_#memory_$Pointer$#1.base| .cse39)) (= 4 (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse40)) (not (= v_DerPreprocessor_10 3)) (= (select .cse41 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)))))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_165 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_10 Int)) (let ((.cse43 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_33) 3 .cse6)) (.cse42 (+ v_prenex_165 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse42) 4) (= .cse4 (select .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10) (select .cse43 v_DerPreprocessor_10)) (not (= .cse42 0)) (not (= v_DerPreprocessor_10 3)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10))))))) (and .cse8 (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse46 (select (select .cse45 3) 0))) (let ((.cse47 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse44 (store (store (store |c_#memory_$Pointer$#1.base| .cse46 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse44 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select (select .cse45 .cse46) (+ 4 v_arrayElimCell_71))) (= v_DerPreprocessor_16 (store .cse47 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse45 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse46) (= (store .cse47 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse46) (= (select .cse44 .cse46) v_DerPreprocessor_14)))))))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3))) is different from true [2023-12-16 04:36:01,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:36:06,070 INFO L349 Elim1Store]: treesize reduction 3857, result has 13.2 percent of original size [2023-12-16 04:36:06,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 1 disjoint index pairs (out of 276 index pairs), introduced 26 new quantified variables, introduced 297 case distinctions, treesize of input 872873 treesize of output 682291 [2023-12-16 04:36:07,722 INFO L349 Elim1Store]: treesize reduction 184, result has 66.7 percent of original size [2023-12-16 04:36:07,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 5397 treesize of output 5730 [2023-12-16 04:36:08,247 INFO L349 Elim1Store]: treesize reduction 55, result has 30.4 percent of original size [2023-12-16 04:36:08,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 5388 treesize of output 5379 [2023-12-16 04:36:09,022 INFO L349 Elim1Store]: treesize reduction 47, result has 33.8 percent of original size [2023-12-16 04:36:09,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 5330 treesize of output 5321 [2023-12-16 04:36:10,337 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-16 04:36:13,168 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 7 treesize of output 3 [2023-12-16 04:36:14,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-16 04:36:14,430 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 67 treesize of output 61 [2023-12-16 04:36:14,463 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 67 treesize of output 61 [2023-12-16 04:36:14,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 248 [2023-12-16 04:36:14,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 168 [2023-12-16 04:36:14,813 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 113 treesize of output 105 [2023-12-16 04:36:14,859 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 111 treesize of output 87 [2023-12-16 04:36:14,897 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 109 treesize of output 85 [2023-12-16 04:36:14,936 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 24 treesize of output 18 [2023-12-16 04:36:15,287 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 19 treesize of output 17 [2023-12-16 04:36:15,376 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 19 treesize of output 17 [2023-12-16 04:36:15,448 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 19 treesize of output 17 [2023-12-16 04:36:15,495 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 19 treesize of output 17 [2023-12-16 04:36:15,543 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 19 treesize of output 17 [2023-12-16 04:36:15,646 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 26 treesize of output 24 [2023-12-16 04:36:15,731 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 18 treesize of output 16 [2023-12-16 04:36:15,782 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:15,797 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:15,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:15,833 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:15,846 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:15,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:15,903 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 26 treesize of output 24 [2023-12-16 04:36:15,941 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 18 treesize of output 16 [2023-12-16 04:36:17,092 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 24 treesize of output 22 [2023-12-16 04:36:17,191 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 12 treesize of output 1 [2023-12-16 04:36:17,197 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 7 [2023-12-16 04:36:17,217 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 7 [2023-12-16 04:36:17,224 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 7 [2023-12-16 04:36:17,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-16 04:36:17,419 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:36:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-16 04:36:17,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:17,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344943566] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:17,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:36:17,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-12-16 04:36:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549480095] [2023-12-16 04:36:17,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:36:17,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-16 04:36:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:17,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-16 04:36:17,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=752, Unknown=10, NotChecked=56, Total=930 [2023-12-16 04:36:17,775 INFO L87 Difference]: Start difference. First operand 240 states and 290 transitions. Second operand has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 04:36:24,414 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,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:25,615 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2023-12-16 04:36:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:36:25,616 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2023-12-16 04:36:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:25,617 INFO L225 Difference]: With dead ends: 257 [2023-12-16 04:36:25,617 INFO L226 Difference]: Without dead ends: 254 [2023-12-16 04:36:25,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=227, Invalid=1325, Unknown=12, NotChecked=76, Total=1640 [2023-12-16 04:36:25,619 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 643 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 107 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:25,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 208 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1523 Invalid, 37 Unknown, 215 Unchecked, 6.3s Time] [2023-12-16 04:36:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-16 04:36:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-12-16 04:36:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2254901960784315) internal successors, (250), 219 states have internal predecessors, (250), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:36:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 289 transitions. [2023-12-16 04:36:25,656 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 289 transitions. Word has length 36 [2023-12-16 04:36:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:25,657 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 289 transitions. [2023-12-16 04:36:25,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 04:36:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 289 transitions. [2023-12-16 04:36:25,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 04:36:25,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:25,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:25,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-16 04:36:25,861 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,SelfDestructingSolverStorable9 [2023-12-16 04:36:25,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:25,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -424121341, now seen corresponding path program 1 times [2023-12-16 04:36:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:25,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699807850] [2023-12-16 04:36:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:26,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:36:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:26,977 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:36:26,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:26,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699807850] [2023-12-16 04:36:26,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699807850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:36:26,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:36:26,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-16 04:36:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502734252] [2023-12-16 04:36:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:36:26,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:36:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:36:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:36:26,980 INFO L87 Difference]: Start difference. First operand 240 states and 289 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:36:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:28,425 INFO L93 Difference]: Finished difference Result 256 states and 303 transitions. [2023-12-16 04:36:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:36:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-12-16 04:36:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:28,426 INFO L225 Difference]: With dead ends: 256 [2023-12-16 04:36:28,426 INFO L226 Difference]: Without dead ends: 253 [2023-12-16 04:36:28,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-12-16 04:36:28,427 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 361 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:28,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 192 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:36:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-16 04:36:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2023-12-16 04:36:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2205882352941178) internal successors, (249), 219 states have internal predecessors, (249), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:36:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 288 transitions. [2023-12-16 04:36:28,470 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 288 transitions. Word has length 38 [2023-12-16 04:36:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:28,470 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 288 transitions. [2023-12-16 04:36:28,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:36:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 288 transitions. [2023-12-16 04:36:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 04:36:28,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:28,471 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:28,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:36:28,471 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:28,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash -528930837, now seen corresponding path program 1 times [2023-12-16 04:36:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:28,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471083278] [2023-12-16 04:36:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 04:36:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:30,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:36:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 04:36:30,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:36:30,062 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.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) 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:36:30,069 INFO L158 Benchmark]: Toolchain (without parser) took 51664.46ms. Allocated memory was 257.9MB in the beginning and 777.0MB in the end (delta: 519.0MB). Free memory was 202.0MB in the beginning and 727.9MB in the end (delta: -525.9MB). Peak memory consumption was 453.4MB. Max. memory is 8.0GB. [2023-12-16 04:36:30,069 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 185.6MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:36:30,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.68ms. Allocated memory is still 257.9MB. Free memory was 202.0MB in the beginning and 174.8MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-16 04:36:30,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.99ms. Allocated memory is still 257.9MB. Free memory was 174.7MB in the beginning and 172.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:36:30,069 INFO L158 Benchmark]: Boogie Preprocessor took 93.94ms. Allocated memory is still 257.9MB. Free memory was 172.1MB in the beginning and 167.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:36:30,070 INFO L158 Benchmark]: RCFGBuilder took 598.75ms. Allocated memory is still 257.9MB. Free memory was 167.4MB in the beginning and 208.3MB in the end (delta: -40.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-16 04:36:30,070 INFO L158 Benchmark]: TraceAbstraction took 50327.74ms. Allocated memory was 257.9MB in the beginning and 777.0MB in the end (delta: 519.0MB). Free memory was 207.7MB in the beginning and 727.9MB in the end (delta: -520.2MB). Peak memory consumption was 458.7MB. Max. memory is 8.0GB. [2023-12-16 04:36:30,076 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-12-16 04:36:30,081 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 185.6MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 568.68ms. Allocated memory is still 257.9MB. Free memory was 202.0MB in the beginning and 174.8MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.99ms. Allocated memory is still 257.9MB. Free memory was 174.7MB in the beginning and 172.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 93.94ms. Allocated memory is still 257.9MB. Free memory was 172.1MB in the beginning and 167.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 598.75ms. Allocated memory is still 257.9MB. Free memory was 167.4MB in the beginning and 208.3MB in the end (delta: -40.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 50327.74ms. Allocated memory was 257.9MB in the beginning and 777.0MB in the end (delta: 519.0MB). Free memory was 207.7MB in the beginning and 727.9MB in the end (delta: -520.2MB). Peak memory consumption was 458.7MB. 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