/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:55:44,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:55:44,848 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-15 21:55:44,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:55:44,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:55:44,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:55:44,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:55:44,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:55:44,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:55:44,879 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:55:44,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:55:44,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:55:44,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:55:44,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:55:44,880 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:55:44,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:55:44,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:55:44,881 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:55:44,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:55:44,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:55:44,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:55:44,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:55:44,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:55:44,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:55:44,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:55:44,883 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:55:44,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:55:44,883 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:55:44,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:55:44,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:55:44,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:55:44,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:55:44,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:55:44,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:55:44,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:55:44,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:55:44,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:55:44,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:55:44,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:55:44,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:55:44,886 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:55:44,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:55:44,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:55:44,886 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 -> true [2023-12-15 21:55:45,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:55:45,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:55:45,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:55:45,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:55:45,053 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:55:45,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i [2023-12-15 21:55:46,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:55:46,245 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:55:46,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i [2023-12-15 21:55:46,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901daa220/582cde9ca97c47339b88a5b308b033ef/FLAG982ebd931 [2023-12-15 21:55:46,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/901daa220/582cde9ca97c47339b88a5b308b033ef [2023-12-15 21:55:46,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:55:46,265 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:55:46,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:55:46,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:55:46,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:55:46,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c92a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46, skipping insertion in model container [2023-12-15 21:55:46,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,314 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:55:46,503 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i[24038,24051] [2023-12-15 21:55:46,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:55:46,517 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:55:46,550 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i[24038,24051] [2023-12-15 21:55:46,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:55:46,580 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:55:46,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46 WrapperNode [2023-12-15 21:55:46,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:55:46,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:55:46,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:55:46,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:55:46,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,617 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2023-12-15 21:55:46,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:55:46,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:55:46,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:55:46,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:55:46,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,641 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 7, 6]. 47 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2023-12-15 21:55:46,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:55:46,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:55:46,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:55:46,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:55:46,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (1/1) ... [2023-12-15 21:55:46,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:55:46,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:46,687 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-15 21:55:46,689 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-15 21:55:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:55:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:55:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:55:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:55:46,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-15 21:55:46,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:55:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:55:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:55:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:55:46,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:55:46,805 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:55:46,807 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:55:46,914 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:55:46,947 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:55:46,947 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-15 21:55:46,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:46 BoogieIcfgContainer [2023-12-15 21:55:46,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:55:46,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:55:46,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:55:46,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:55:46,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:55:46" (1/3) ... [2023-12-15 21:55:46,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373ac8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:55:46, skipping insertion in model container [2023-12-15 21:55:46,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:46" (2/3) ... [2023-12-15 21:55:46,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373ac8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:55:46, skipping insertion in model container [2023-12-15 21:55:46,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:46" (3/3) ... [2023-12-15 21:55:46,952 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2023-12-15 21:55:46,964 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:55:46,964 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:55:46,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:55:46,997 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;@2cc307c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:55:46,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:55:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 21:55:47,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:47,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:47,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:47,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:47,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1741432617, now seen corresponding path program 1 times [2023-12-15 21:55:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:47,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915644227] [2023-12-15 21:55:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:47,219 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-15 21:55:47,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915644227] [2023-12-15 21:55:47,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915644227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:47,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:55:47,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:55:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772198097] [2023-12-15 21:55:47,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:47,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:55:47,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:47,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:55:47,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:55:47,244 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:47,290 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2023-12-15 21:55:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:55:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-15 21:55:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:47,296 INFO L225 Difference]: With dead ends: 33 [2023-12-15 21:55:47,296 INFO L226 Difference]: Without dead ends: 16 [2023-12-15 21:55:47,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:55:47,301 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:47,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-15 21:55:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2023-12-15 21:55:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-15 21:55:47,322 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2023-12-15 21:55:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:47,323 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-15 21:55:47,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-15 21:55:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 21:55:47,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:47,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:47,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:55:47,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:47,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash -905042275, now seen corresponding path program 1 times [2023-12-15 21:55:47,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:47,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656638404] [2023-12-15 21:55:47,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656638404] [2023-12-15 21:55:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656638404] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245014833] [2023-12-15 21:55:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:47,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:47,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:47,437 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-15 21:55:47,439 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-15 21:55:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:47,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:55:47,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:47,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245014833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:47,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:47,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-12-15 21:55:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952177863] [2023-12-15 21:55:47,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:47,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:55:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:55:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:55:47,610 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:47,643 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-12-15 21:55:47,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:55:47,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-15 21:55:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:47,644 INFO L225 Difference]: With dead ends: 28 [2023-12-15 21:55:47,644 INFO L226 Difference]: Without dead ends: 17 [2023-12-15 21:55:47,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:55:47,646 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:47,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-15 21:55:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-15 21:55:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-15 21:55:47,653 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2023-12-15 21:55:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:47,654 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-15 21:55:47,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-15 21:55:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-15 21:55:47,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:47,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:47,663 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-15 21:55:47,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:47,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:47,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash -292807965, now seen corresponding path program 2 times [2023-12-15 21:55:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296246535] [2023-12-15 21:55:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:55:48,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:48,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296246535] [2023-12-15 21:55:48,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296246535] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:48,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15625358] [2023-12-15 21:55:48,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:55:48,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:48,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:48,035 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-15 21:55:48,060 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-15 21:55:48,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-15 21:55:48,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:48,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 21:55:48,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:48,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15625358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:48,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-12-15 21:55:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589490860] [2023-12-15 21:55:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:48,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:55:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:55:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:55:48,150 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:48,172 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-12-15 21:55:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:55:48,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-15 21:55:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:48,174 INFO L225 Difference]: With dead ends: 27 [2023-12-15 21:55:48,174 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 21:55:48,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:55:48,176 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:48,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 21:55:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2023-12-15 21:55:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-15 21:55:48,182 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2023-12-15 21:55:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:48,182 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-15 21:55:48,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-15 21:55:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-15 21:55:48,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:48,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:48,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:48,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-15 21:55:48,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:48,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1138167118, now seen corresponding path program 1 times [2023-12-15 21:55:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:48,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132748727] [2023-12-15 21:55:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:48,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:48,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:48,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132748727] [2023-12-15 21:55:48,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132748727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:48,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:55:48,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:55:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368345910] [2023-12-15 21:55:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:48,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:55:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:48,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:55:48,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:55:48,636 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:48,691 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-15 21:55:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:55:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-15 21:55:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:48,693 INFO L225 Difference]: With dead ends: 28 [2023-12-15 21:55:48,693 INFO L226 Difference]: Without dead ends: 18 [2023-12-15 21:55:48,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:55:48,694 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:48,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 41 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-15 21:55:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-15 21:55:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-15 21:55:48,702 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2023-12-15 21:55:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:48,703 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-15 21:55:48,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-15 21:55:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-15 21:55:48,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:48,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:48,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:55:48,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:48,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash 945592806, now seen corresponding path program 1 times [2023-12-15 21:55:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:48,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747728657] [2023-12-15 21:55:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:55:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747728657] [2023-12-15 21:55:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747728657] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410421053] [2023-12-15 21:55:48,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:48,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:48,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:48,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:48,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:55:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:48,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 21:55:48,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:48,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410421053] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:48,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2023-12-15 21:55:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018221885] [2023-12-15 21:55:48,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:48,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:55:48,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:55:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:55:48,996 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:49,025 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-12-15 21:55:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:55:49,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-15 21:55:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:49,026 INFO L225 Difference]: With dead ends: 28 [2023-12-15 21:55:49,026 INFO L226 Difference]: Without dead ends: 24 [2023-12-15 21:55:49,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:55:49,027 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:49,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-15 21:55:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-15 21:55:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-12-15 21:55:49,030 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2023-12-15 21:55:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:49,030 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-12-15 21:55:49,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-12-15 21:55:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 21:55:49,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:49,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:49,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-15 21:55:49,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:49,235 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:49,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1136358743, now seen corresponding path program 2 times [2023-12-15 21:55:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:49,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478128241] [2023-12-15 21:55:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:49,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478128241] [2023-12-15 21:55:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478128241] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988183140] [2023-12-15 21:55:49,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:55:49,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:49,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:49,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:49,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:55:49,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:55:49,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:49,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-15 21:55:49,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:49,945 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 45 treesize of output 33 [2023-12-15 21:55:49,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2023-12-15 21:55:49,974 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 31 treesize of output 19 [2023-12-15 21:55:49,976 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 25 treesize of output 13 [2023-12-15 21:55:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:55:49,991 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:49,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988183140] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:49,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:49,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2023-12-15 21:55:49,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372931868] [2023-12-15 21:55:49,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:49,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:55:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:55:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:55:49,992 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:50,032 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-12-15 21:55:50,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:55:50,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-15 21:55:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:50,034 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:55:50,034 INFO L226 Difference]: Without dead ends: 28 [2023-12-15 21:55:50,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:55:50,035 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:50,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-15 21:55:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-15 21:55:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-15 21:55:50,038 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2023-12-15 21:55:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:50,038 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-15 21:55:50,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-15 21:55:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 21:55:50,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:50,039 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:50,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:50,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:50,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:50,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash 428861171, now seen corresponding path program 1 times [2023-12-15 21:55:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395149559] [2023-12-15 21:55:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:55:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395149559] [2023-12-15 21:55:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395149559] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274921234] [2023-12-15 21:55:50,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:50,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:50,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:50,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 21:55:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:50,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-15 21:55:50,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:50,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-15 21:55:50,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-15 21:55:50,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-12-15 21:55:51,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-12-15 21:55:51,024 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 9 treesize of output 3 [2023-12-15 21:55:51,026 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 9 treesize of output 3 [2023-12-15 21:55:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:51,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:51,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2023-12-15 21:55:51,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:51,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:51,191 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-15 21:55:51,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-15 21:55:51,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-12-15 21:55:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274921234] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:51,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:51,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2023-12-15 21:55:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041035298] [2023-12-15 21:55:51,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:51,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-15 21:55:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:51,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-15 21:55:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2023-12-15 21:55:51,218 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:51,533 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-12-15 21:55:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:55:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-15 21:55:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:51,537 INFO L225 Difference]: With dead ends: 57 [2023-12-15 21:55:51,537 INFO L226 Difference]: Without dead ends: 39 [2023-12-15 21:55:51,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2023-12-15 21:55:51,538 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 67 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:51,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 83 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:55:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-15 21:55:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-12-15 21:55:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-12-15 21:55:51,548 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2023-12-15 21:55:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:51,548 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-12-15 21:55:51,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-12-15 21:55:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 21:55:51,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:51,549 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:51,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:51,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:51,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:51,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1066250312, now seen corresponding path program 2 times [2023-12-15 21:55:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:51,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199386482] [2023-12-15 21:55:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:55:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199386482] [2023-12-15 21:55:52,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199386482] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633659629] [2023-12-15 21:55:52,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:55:52,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:52,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:52,468 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:52,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 21:55:52,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:55:52,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:52,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-15 21:55:52,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:52,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:55:52,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-15 21:55:52,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:52,777 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:55:52,777 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-15 21:55:52,808 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 21 treesize of output 23 [2023-12-15 21:55:52,812 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 8 treesize of output 7 [2023-12-15 21:55:52,819 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2023-12-15 21:55:52,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-15 21:55:52,941 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 65 treesize of output 41 [2023-12-15 21:55:53,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2023-12-15 21:55:53,062 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-12-15 21:55:53,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 20 [2023-12-15 21:55:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:55:53,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:53,219 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 84 treesize of output 64 [2023-12-15 21:55:53,222 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 68 treesize of output 48 [2023-12-15 21:55:53,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:53,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:53,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:53,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:53,272 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_2 .cse0))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) 0))))) is different from false [2023-12-15 21:55:53,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:55:53,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:53,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-12-15 21:55:53,370 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 36 treesize of output 24 [2023-12-15 21:55:53,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:53,377 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 18 treesize of output 20 [2023-12-15 21:55:53,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:53,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-15 21:55:53,403 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 36 treesize of output 24 [2023-12-15 21:55:53,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:53,411 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 18 treesize of output 20 [2023-12-15 21:55:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2023-12-15 21:55:53,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633659629] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:53,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:53,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2023-12-15 21:55:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549103077] [2023-12-15 21:55:53,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:53,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-15 21:55:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:53,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-15 21:55:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=781, Unknown=1, NotChecked=56, Total=930 [2023-12-15 21:55:53,492 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:53,866 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2023-12-15 21:55:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:55:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-15 21:55:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:53,867 INFO L225 Difference]: With dead ends: 67 [2023-12-15 21:55:53,867 INFO L226 Difference]: Without dead ends: 38 [2023-12-15 21:55:53,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=989, Unknown=1, NotChecked=64, Total=1190 [2023-12-15 21:55:53,868 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:53,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 148 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2023-12-15 21:55:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-15 21:55:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-15 21:55:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-12-15 21:55:53,872 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 29 [2023-12-15 21:55:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:53,872 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-12-15 21:55:53,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-12-15 21:55:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:55:53,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:53,872 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:53,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:54,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:54,074 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:54,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 4285694, now seen corresponding path program 3 times [2023-12-15 21:55:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764325847] [2023-12-15 21:55:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 21:55:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764325847] [2023-12-15 21:55:54,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764325847] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064989430] [2023-12-15 21:55:54,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 21:55:54,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:54,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:54,136 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:54,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 21:55:54,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-15 21:55:54,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:54,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:55:54,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 21:55:54,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:54,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064989430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-15 21:55:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359529827] [2023-12-15 21:55:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:54,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:55:54,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:54,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:55:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:55:54,366 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:54,376 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-12-15 21:55:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:55:54,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-15 21:55:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:54,377 INFO L225 Difference]: With dead ends: 37 [2023-12-15 21:55:54,377 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:55:54,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:55:54,379 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:54,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:55:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:55:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:55:54,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2023-12-15 21:55:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:54,381 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:55:54,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:55:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:55:54,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:55:54,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:55:54,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:54,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:54,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:55:54,811 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-15 21:55:54,811 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-15 21:55:54,811 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 605) no Hoare annotation was computed. [2023-12-15 21:55:54,811 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 607 621) no Hoare annotation was computed. [2023-12-15 21:55:54,811 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse3 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~#s~0#1.offset| 0))) (or (and .cse0 (= (select (select |#memory_$Pointer$#1.base| .cse1) 4) 0) .cse2 (<= |ULTIMATE.start_sll_create_~len#1| 0) .cse3 (not (= |ULTIMATE.start_sll_create_~head~0#1.base| .cse1)) .cse4 (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0)) (and .cse0 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 .cse3 (= |ULTIMATE.start_sll_create_~len#1| 1) (= .cse1 0) .cse4) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse2 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) .cse4 (= |ULTIMATE.start_main_~len~0#1| 2)))) [2023-12-15 21:55:54,811 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-12-15 21:55:54,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2023-12-15 21:55:54,811 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2023-12-15 21:55:54,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:55:54,812 INFO L899 garLoopResultBuilder]: For program point L599-1(lines 599 602) no Hoare annotation was computed. [2023-12-15 21:55:54,812 INFO L895 garLoopResultBuilder]: At program point L599-3(lines 599 602) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse11 0)) (.cse12 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse2 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0)) (.cse4 (= (select .cse12 0) 0)) (.cse7 (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse9 (= (select (select |#memory_$Pointer$#1.offset| .cse6) 4) 0)) (.cse10 (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select (select |#memory_$Pointer$#1.base| .cse0) 4) 0) .cse1 (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) .cse2 .cse3 (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0) .cse4 (exists ((|v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22| Int)) (let ((.cse5 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22|) 4))) (and (not (= .cse5 |v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22|)) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22|) 4) 0) (= .cse5 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (= (select (select |#memory_$Pointer$#1.base| .cse5) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse5) 4) 0)))) (= .cse6 |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) .cse7 .cse8 .cse9 .cse10)) (and .cse1 (= (select .cse11 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse12 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) .cse10) (let ((.cse13 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 4))) (and (= .cse6 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) .cse1 .cse2 .cse3 (not (= .cse13 0)) (= (select (select |#memory_$Pointer$#1.base| .cse13) 4) 0) .cse4 .cse7 .cse8 .cse9 (= (select (select |#memory_$Pointer$#1.offset| .cse13) 4) 0) .cse10)))))) [2023-12-15 21:55:54,812 INFO L899 garLoopResultBuilder]: For program point L599-4(lines 599 602) no Hoare annotation was computed. [2023-12-15 21:55:54,812 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:55:54,812 INFO L895 garLoopResultBuilder]: At program point L612-3(lines 612 614) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse5 0)) (.cse6 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse2 (= (select .cse6 0) 0)) (.cse0 (select (select |#memory_$Pointer$#1.base| .cse7) 4)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= (select (select |#memory_$Pointer$#1.offset| .cse7) 4) 0))) (or (and (= (select (select |#memory_$Pointer$#1.base| .cse0) 4) 0) .cse1 (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0) .cse2 .cse3 .cse4) (and .cse1 (= (select .cse5 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse6 |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (and .cse1 .cse2 (= .cse0 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4))))) [2023-12-15 21:55:54,812 INFO L899 garLoopResultBuilder]: For program point L612-4(lines 612 614) no Hoare annotation was computed. [2023-12-15 21:55:54,812 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 607 621) no Hoare annotation was computed. [2023-12-15 21:55:54,812 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2023-12-15 21:55:54,815 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1] [2023-12-15 21:55:54,816 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:55:54,825 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-15 21:55:54,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-15 21:55:54,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-15 21:55:54,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22 : int :: (((!(#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4] == v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4] == 0) && #memory_$Pointer$#1.base[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4] == ~last~0!base) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4]][4] == 0) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4]][4] == 0) could not be translated [2023-12-15 21:55:54,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-15 21:55:54,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:54,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-12-15 21:55:54,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:54,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-15 21:55:54,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][4] could not be translated [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated [2023-12-15 21:55:54,829 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:54,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:55:54,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-12-15 21:55:54,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:55:54,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:55:54,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:55:54,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-12-15 21:55:54,831 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:55:54,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-15 21:55:54,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-15 21:55:54,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-15 21:55:54,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-12-15 21:55:54,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-15 21:55:54,832 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-15 21:55:54,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-15 21:55:54,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-12-15 21:55:54,833 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-12-15 21:55:54,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:55:54 BoogieIcfgContainer [2023-12-15 21:55:54,833 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:55:54,833 INFO L158 Benchmark]: Toolchain (without parser) took 8568.67ms. Allocated memory was 211.8MB in the beginning and 306.2MB in the end (delta: 94.4MB). Free memory was 168.7MB in the beginning and 146.2MB in the end (delta: 22.5MB). Peak memory consumption was 117.6MB. Max. memory is 8.0GB. [2023-12-15 21:55:54,834 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:55:54,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.45ms. Allocated memory is still 211.8MB. Free memory was 168.4MB in the beginning and 150.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:55:54,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.88ms. Allocated memory is still 211.8MB. Free memory was 150.6MB in the beginning and 148.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:55:54,834 INFO L158 Benchmark]: Boogie Preprocessor took 36.08ms. Allocated memory is still 211.8MB. Free memory was 148.5MB in the beginning and 145.7MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:55:54,834 INFO L158 Benchmark]: RCFGBuilder took 292.67ms. Allocated memory is still 211.8MB. Free memory was 145.7MB in the beginning and 129.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 21:55:54,834 INFO L158 Benchmark]: TraceAbstraction took 7884.46ms. Allocated memory was 211.8MB in the beginning and 306.2MB in the end (delta: 94.4MB). Free memory was 128.6MB in the beginning and 146.2MB in the end (delta: -17.7MB). Peak memory consumption was 77.8MB. Max. memory is 8.0GB. [2023-12-15 21:55:54,835 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 315.45ms. Allocated memory is still 211.8MB. Free memory was 168.4MB in the beginning and 150.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.88ms. Allocated memory is still 211.8MB. Free memory was 150.6MB in the beginning and 148.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.08ms. Allocated memory is still 211.8MB. Free memory was 148.5MB in the beginning and 145.7MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 292.67ms. Allocated memory is still 211.8MB. Free memory was 145.7MB in the beginning and 129.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7884.46ms. Allocated memory was 211.8MB in the beginning and 306.2MB in the end (delta: 94.4MB). Free memory was 128.6MB in the beginning and 146.2MB in the end (delta: -17.7MB). Peak memory consumption was 77.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22 : int :: (((!(#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4] == v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4] == 0) && #memory_$Pointer$#1.base[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4] == ~last~0!base) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4]][4] == 0) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_remove_last_~last~0#1.base_22][4]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 619]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 430 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 21 IncrementalHoareTripleChecker+Unchecked, 341 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 555 IncrementalHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 89 mSDtfsCounter, 555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 190 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 13 NumberOfFragments, 437 HoareAnnotationTreeSize, 3 FormulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FormulaSimplificationsInter, 93 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 315 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 377 ConstructedInterpolants, 4 QuantifiedInterpolants, 2943 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1747 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 224/281 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((2 <= len) && (len <= 0)) || ((2 <= len) && (len == 1))) || ((2 == len) && (len == 2))) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: ((((2 <= len) && (1 <= i)) || (2 <= len)) || ((2 <= len) && (0 <= i))) RESULT: Ultimate proved your program to be correct! [2023-12-15 21:55:54,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...