/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:49:02,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:49:02,537 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-21 03:49:02,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:49:02,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:49:02,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:49:02,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:49:02,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:49:02,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:49:02,573 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:49:02,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:49:02,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:49:02,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:49:02,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:49:02,575 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:49:02,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:49:02,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:49:02,576 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:49:02,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:49:02,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:49:02,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:49:02,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:49:02,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:49:02,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:49:02,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:49:02,578 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:49:02,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:49:02,578 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:49:02,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:49:02,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:49:02,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:49:02,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:49:02,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:49:02,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:49:02,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:49:02,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:49:02,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:49:02,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:49:02,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:49:02,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:49:02,581 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:49:02,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:49:02,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:49:02,582 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 03:49:02,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:49:02,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:49:02,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:49:02,761 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:49:02,761 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:49:02,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2023-12-21 03:49:03,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:49:04,047 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:49:04,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2023-12-21 03:49:04,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc4e4e85/67ab8d12c8bb435bb038122443b6c178/FLAG03216896e [2023-12-21 03:49:04,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc4e4e85/67ab8d12c8bb435bb038122443b6c178 [2023-12-21 03:49:04,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:49:04,071 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:49:04,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:49:04,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:49:04,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:49:04,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7862c15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04, skipping insertion in model container [2023-12-21 03:49:04,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,112 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:49:04,362 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_insert_unequal.i[24620,24633] [2023-12-21 03:49:04,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:49:04,379 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:49:04,414 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_insert_unequal.i[24620,24633] [2023-12-21 03:49:04,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:49:04,438 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:49:04,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04 WrapperNode [2023-12-21 03:49:04,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:49:04,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:49:04,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:49:04,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:49:04,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,472 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2023-12-21 03:49:04,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:49:04,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:49:04,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:49:04,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:49:04,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,507 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2023-12-21 03:49:04,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:49:04,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:49:04,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:49:04,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:49:04,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (1/1) ... [2023-12-21 03:49:04,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:49:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:04,565 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-21 03:49:04,567 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-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-21 03:49:04,585 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:49:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:49:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:49:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:49:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:49:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:49:04,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:49:04,690 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:49:04,692 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:49:04,889 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:49:04,914 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:49:04,914 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-21 03:49:04,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:49:04 BoogieIcfgContainer [2023-12-21 03:49:04,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:49:04,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:49:04,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:49:04,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:49:04,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:49:04" (1/3) ... [2023-12-21 03:49:04,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ca9140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:49:04, skipping insertion in model container [2023-12-21 03:49:04,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:49:04" (2/3) ... [2023-12-21 03:49:04,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ca9140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:49:04, skipping insertion in model container [2023-12-21 03:49:04,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:49:04" (3/3) ... [2023-12-21 03:49:04,921 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2023-12-21 03:49:04,933 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:49:04,933 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:49:04,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:49:04,972 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;@f7a21fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:49:04,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:49:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 03:49:04,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:04,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:04,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:04,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash -28865109, now seen corresponding path program 1 times [2023-12-21 03:49:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229803282] [2023-12-21 03:49:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:05,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 03:49:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:05,192 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-21 03:49:05,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:05,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229803282] [2023-12-21 03:49:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229803282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:49:05,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:49:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:49:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511460165] [2023-12-21 03:49:05,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:49:05,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:49:05,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:05,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:49:05,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:49:05,231 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:49:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:05,285 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2023-12-21 03:49:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:49:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-21 03:49:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:05,292 INFO L225 Difference]: With dead ends: 50 [2023-12-21 03:49:05,293 INFO L226 Difference]: Without dead ends: 22 [2023-12-21 03:49:05,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-21 03:49:05,299 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:05,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-21 03:49:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-21 03:49:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-12-21 03:49:05,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 14 [2023-12-21 03:49:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:05,323 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-12-21 03:49:05,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:49:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-12-21 03:49:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 03:49:05,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:05,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:05,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:49:05,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:05,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2091124953, now seen corresponding path program 1 times [2023-12-21 03:49:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:05,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532066738] [2023-12-21 03:49:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 03:49:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:05,525 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-21 03:49:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532066738] [2023-12-21 03:49:05,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532066738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:49:05,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:49:05,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:49:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498955446] [2023-12-21 03:49:05,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:49:05,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:49:05,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:05,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:49:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:49:05,528 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:49:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:05,569 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2023-12-21 03:49:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:49:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-21 03:49:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:05,571 INFO L225 Difference]: With dead ends: 43 [2023-12-21 03:49:05,572 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 03:49:05,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:49:05,573 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:05,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 03:49:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-12-21 03:49:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-12-21 03:49:05,584 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2023-12-21 03:49:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:05,584 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-12-21 03:49:05,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:49:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-12-21 03:49:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 03:49:05,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:05,586 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:05,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:49:05,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:05,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2115192704, now seen corresponding path program 1 times [2023-12-21 03:49:05,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:05,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400522280] [2023-12-21 03:49:05,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:49:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400522280] [2023-12-21 03:49:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400522280] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891510197] [2023-12-21 03:49:05,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:05,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:05,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:05,785 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-21 03:49:05,822 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-21 03:49:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:05,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:49:05,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:49:05,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:06,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891510197] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:49:06,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:49:06,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-12-21 03:49:06,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472856452] [2023-12-21 03:49:06,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:06,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:49:06,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:06,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:49:06,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:49:06,038 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 03:49:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:06,105 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2023-12-21 03:49:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:49:06,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2023-12-21 03:49:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:06,108 INFO L225 Difference]: With dead ends: 44 [2023-12-21 03:49:06,108 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 03:49:06,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:49:06,112 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:06,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 80 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 03:49:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 03:49:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-12-21 03:49:06,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 20 [2023-12-21 03:49:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:06,123 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-12-21 03:49:06,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 03:49:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-12-21 03:49:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 03:49:06,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:06,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:06,148 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-21 03:49:06,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:06,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:06,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1441189607, now seen corresponding path program 2 times [2023-12-21 03:49:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949475715] [2023-12-21 03:49:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:49:06,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:06,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949475715] [2023-12-21 03:49:06,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949475715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:49:06,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:49:06,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:49:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559772122] [2023-12-21 03:49:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:49:06,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:49:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:49:06,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:49:06,476 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:49:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:06,509 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2023-12-21 03:49:06,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:49:06,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-12-21 03:49:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:06,511 INFO L225 Difference]: With dead ends: 39 [2023-12-21 03:49:06,511 INFO L226 Difference]: Without dead ends: 29 [2023-12-21 03:49:06,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:49:06,516 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:06,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-21 03:49:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-12-21 03:49:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-21 03:49:06,525 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 26 [2023-12-21 03:49:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:06,526 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-21 03:49:06,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:49:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-21 03:49:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 03:49:06,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:06,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:06,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 03:49:06,527 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:06,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1439342565, now seen corresponding path program 1 times [2023-12-21 03:49:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:06,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614078323] [2023-12-21 03:49:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:49:06,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614078323] [2023-12-21 03:49:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614078323] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536921884] [2023-12-21 03:49:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:06,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:06,760 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-21 03:49:06,779 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-21 03:49:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:06,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:49:06,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:49:06,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:49:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536921884] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:49:06,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:49:06,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-21 03:49:06,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749985413] [2023-12-21 03:49:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:49:06,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:49:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:06,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:49:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:49:06,953 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:06,976 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2023-12-21 03:49:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:49:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-12-21 03:49:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:06,977 INFO L225 Difference]: With dead ends: 38 [2023-12-21 03:49:06,978 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 03:49:06,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:49:06,978 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:06,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:49:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 03:49:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-21 03:49:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-21 03:49:06,984 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 26 [2023-12-21 03:49:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:06,985 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-21 03:49:06,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:49:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-21 03:49:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:49:06,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:06,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:06,994 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-21 03:49:07,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:07,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:07,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -262117536, now seen corresponding path program 1 times [2023-12-21 03:49:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125680358] [2023-12-21 03:49:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:49:08,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125680358] [2023-12-21 03:49:08,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125680358] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328254688] [2023-12-21 03:49:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:08,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:08,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:08,192 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-21 03:49:08,194 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-21 03:49:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:08,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-21 03:49:08,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:08,524 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-21 03:49:08,534 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-21 03:49:08,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 03:49:08,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-21 03:49:08,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:49:08,824 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-21 03:49:08,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-21 03:49:08,844 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:49:08,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 03:49:09,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-21 03:49:09,113 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-21 03:49:09,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 03:49:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:09,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328254688] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:09,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:49:09,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2023-12-21 03:49:09,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772207133] [2023-12-21 03:49:09,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:09,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-21 03:49:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-21 03:49:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 03:49:09,440 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:49:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:09,877 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2023-12-21 03:49:09,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 03:49:09,877 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-12-21 03:49:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:09,878 INFO L225 Difference]: With dead ends: 41 [2023-12-21 03:49:09,878 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 03:49:09,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2023-12-21 03:49:09,879 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:09,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 246 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 03:49:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 03:49:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-12-21 03:49:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-12-21 03:49:09,884 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 27 [2023-12-21 03:49:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:09,884 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-12-21 03:49:09,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:49:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-12-21 03:49:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:49:09,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:09,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:09,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 03:49:10,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:10,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:10,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash -260270494, now seen corresponding path program 1 times [2023-12-21 03:49:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:10,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122685976] [2023-12-21 03:49:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:10,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:10,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:10,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:49:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122685976] [2023-12-21 03:49:10,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122685976] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:10,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710015543] [2023-12-21 03:49:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:10,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:10,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:10,269 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-21 03:49:10,299 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-21 03:49:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:10,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 03:49:10,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:10,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-21 03:49:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:10,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:10,567 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 8 treesize of output 4 [2023-12-21 03:49:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:49:10,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710015543] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:49:10,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:49:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-12-21 03:49:10,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930184058] [2023-12-21 03:49:10,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:10,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 03:49:10,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:10,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 03:49:10,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-12-21 03:49:10,587 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 03:49:14,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:18,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:22,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:26,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:30,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:34,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:38,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:38,860 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2023-12-21 03:49:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 03:49:38,860 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 27 [2023-12-21 03:49:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:38,861 INFO L225 Difference]: With dead ends: 55 [2023-12-21 03:49:38,861 INFO L226 Difference]: Without dead ends: 45 [2023-12-21 03:49:38,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2023-12-21 03:49:38,862 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:38,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 306 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2023-12-21 03:49:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-21 03:49:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2023-12-21 03:49:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-12-21 03:49:38,867 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 27 [2023-12-21 03:49:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:38,868 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-12-21 03:49:38,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 03:49:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-12-21 03:49:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:49:38,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:38,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:38,879 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-21 03:49:39,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:39,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:39,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 464236054, now seen corresponding path program 1 times [2023-12-21 03:49:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087345069] [2023-12-21 03:49:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:49:39,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087345069] [2023-12-21 03:49:39,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087345069] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409360940] [2023-12-21 03:49:39,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:39,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:39,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:39,344 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-21 03:49:39,346 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-21 03:49:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:39,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 03:49:39,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:39,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-21 03:49:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:39,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:49:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409360940] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:49:39,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:49:39,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2023-12-21 03:49:39,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116377866] [2023-12-21 03:49:39,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 03:49:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 03:49:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-21 03:49:39,698 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:49:43,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:47,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:51,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:55,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:59,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:03,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:07,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:07,883 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2023-12-21 03:50:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 03:50:07,884 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-12-21 03:50:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:07,884 INFO L225 Difference]: With dead ends: 56 [2023-12-21 03:50:07,885 INFO L226 Difference]: Without dead ends: 49 [2023-12-21 03:50:07,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-21 03:50:07,885 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:07,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 232 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2023-12-21 03:50:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-21 03:50:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2023-12-21 03:50:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:50:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-12-21 03:50:07,890 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2023-12-21 03:50:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:07,890 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-12-21 03:50:07,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:50:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-12-21 03:50:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:50:07,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:07,891 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:07,901 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-21 03:50:08,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:08,097 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:08,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1929378297, now seen corresponding path program 2 times [2023-12-21 03:50:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339240020] [2023-12-21 03:50:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:50:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:08,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339240020] [2023-12-21 03:50:08,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339240020] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:08,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539546857] [2023-12-21 03:50:08,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:50:08,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:08,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:08,258 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-21 03:50:08,260 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-21 03:50:08,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:50:08,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:50:08,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 03:50:08,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:50:08,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:50:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539546857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:50:08,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:50:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-12-21 03:50:08,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344336514] [2023-12-21 03:50:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:50:08,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:50:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:50:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:50:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:50:08,478 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:50:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:08,506 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-12-21 03:50:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:50:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-12-21 03:50:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:08,507 INFO L225 Difference]: With dead ends: 46 [2023-12-21 03:50:08,507 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 03:50:08,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-21 03:50:08,509 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:08,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:50:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 03:50:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-21 03:50:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:50:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-12-21 03:50:08,522 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 28 [2023-12-21 03:50:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:08,522 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-12-21 03:50:08,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:50:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-12-21 03:50:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:50:08,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:08,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:08,532 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-21 03:50:08,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:08,729 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:08,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1508130747, now seen corresponding path program 1 times [2023-12-21 03:50:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31881645] [2023-12-21 03:50:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:08,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:08,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:50:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31881645] [2023-12-21 03:50:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31881645] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862898720] [2023-12-21 03:50:08,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:08,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:08,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:08,975 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-21 03:50:08,996 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-21 03:50:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:09,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 03:50:09,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:50:09,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:50:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:50:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862898720] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:50:09,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:50:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2023-12-21 03:50:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847415373] [2023-12-21 03:50:09,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:50:09,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 03:50:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:50:09,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 03:50:09,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-21 03:50:09,249 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:09,382 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-12-21 03:50:09,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 03:50:09,382 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-12-21 03:50:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:09,383 INFO L225 Difference]: With dead ends: 42 [2023-12-21 03:50:09,383 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 03:50:09,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-12-21 03:50:09,384 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 63 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:09,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 102 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:50:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 03:50:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-12-21 03:50:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:50:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-21 03:50:09,387 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2023-12-21 03:50:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:09,387 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-21 03:50:09,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-21 03:50:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 03:50:09,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:09,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:09,398 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-21 03:50:09,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:09,596 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:09,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:09,597 INFO L85 PathProgramCache]: Analyzing trace with hash -492642021, now seen corresponding path program 1 times [2023-12-21 03:50:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:09,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298328138] [2023-12-21 03:50:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:50:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298328138] [2023-12-21 03:50:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298328138] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085369037] [2023-12-21 03:50:10,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:10,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:10,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:10,498 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:50:10,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 03:50:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:10,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-21 03:50:10,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:10,832 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-21 03:50:10,873 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-21 03:50:10,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-21 03:50:10,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:50:11,068 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-21 03:50:11,124 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:50:11,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 03:50:11,136 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-21 03:50:11,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-21 03:50:11,359 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 31 treesize of output 15 [2023-12-21 03:50:11,365 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 19 treesize of output 11 [2023-12-21 03:50:11,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 89 [2023-12-21 03:50:11,435 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:50:11,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2023-12-21 03:50:11,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-21 03:50:11,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-21 03:50:11,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-21 03:50:11,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-21 03:50:11,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:50:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:50:11,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:50:11,595 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1429 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1429)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1427) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse0) .cse1))))) is different from false [2023-12-21 03:50:11,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:11,602 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 77 treesize of output 78 [2023-12-21 03:50:11,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:11,611 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 150 treesize of output 149 [2023-12-21 03:50:11,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-12-21 03:50:11,709 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse2)) (.cse3 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse5 (+ .cse1 4))) (let ((.cse0 (and (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1423 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1423))) (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1429)))) (.cse12 (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse2) .cse5))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_28) .cse12)) (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_29) .cse12)))))) (or .cse6 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int)) (v_arrayElimCell_28 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1423))) (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1429))) v_arrayElimCell_28) (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse2) .cse5)))))))) (and (or .cse0 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| .cse1)) (or .cse0 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse2)) (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1429) (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse2) .cse5)))) .cse6) (or (not .cse6) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1423 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1423))) (store .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1429))) v_arrayElimCell_29) (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse2) .cse5))))) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1423))) (let ((.cse8 (store (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1429)) (.cse9 (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse2) .cse5))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse9)) (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse8) v_arrayElimCell_29) .cse9))))))))))) is different from false [2023-12-21 03:50:11,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse4)) (.cse6 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse5 (+ .cse10 4))) (let ((.cse7 (and (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1423 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1423))) (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1429)))) (.cse12 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse4) .cse5))) (or (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_29) .cse12))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_28) .cse12))))) (or .cse8 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int)) (v_arrayElimCell_28 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1423))) (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1429))) v_arrayElimCell_28) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse4) .cse5)))))))) (and (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1423))) (let ((.cse0 (store (select .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1429)) (.cse1 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse0) v_arrayElimCell_29) .cse1))))))) (or .cse7 (= .cse4 |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (or (not .cse8) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1423 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1423))) (store .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1429))) v_arrayElimCell_29) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse4) .cse5))))) (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1429) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) .cse4) .cse5)))) .cse8) (or (= .cse10 |c_ULTIMATE.start_sll_insert_~last~0#1.offset|) .cse7))))) is different from false [2023-12-21 03:50:11,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse8)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#2.offset| .cse6 (store (select |c_#memory_$Pointer$#2.offset| .cse6) (+ .cse1 4) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (.cse9 (+ .cse0 4))) (let ((.cse2 (and (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1423 (Array Int Int))) (let ((.cse13 (let ((.cse15 (store |c_#memory_int#2| .cse6 v_ArrVal_1423))) (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1429)))) (.cse14 (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) .cse8) .cse9))) (or (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_29) .cse14))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_28) .cse14))))) (or .cse3 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int)) (v_arrayElimCell_28 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse16 (store |c_#memory_int#2| .cse6 v_ArrVal_1423))) (store .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1429))) v_arrayElimCell_28) (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) .cse8) .cse9)))))))) (and (or (= .cse0 .cse1) .cse2) (or (not .cse3) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1423 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse4 (store |c_#memory_int#2| .cse6 v_ArrVal_1423))) (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1429))) v_arrayElimCell_29) (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) .cse8) .cse9))))) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#2| .cse6 v_ArrVal_1423))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1429)) (.cse12 (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) .cse8) .cse9))) (or (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse11) v_arrayElimCell_29) .cse12))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse12)))))) (or (= .cse8 .cse6) .cse2) (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1429 Int) (v_ArrVal_1423 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse6 v_ArrVal_1423) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_1429) (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) .cse8) .cse9)))) .cse3))))) is different from false [2023-12-21 03:50:13,483 INFO L349 Elim1Store]: treesize reduction 792, result has 80.7 percent of original size [2023-12-21 03:50:13,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 4097 treesize of output 6524 [2023-12-21 03:50:13,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:50:13,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 3528 treesize of output 3766 [2023-12-21 03:50:13,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3047 treesize of output 2783 [2023-12-21 03:50:14,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2971 treesize of output 2839 [2023-12-21 03:50:14,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2933 treesize of output 2845 [2023-12-21 03:50:14,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3221 treesize of output 2957 [2023-12-21 03:50:14,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3145 treesize of output 3013 [2023-12-21 03:50:14,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3107 treesize of output 3063 [2023-12-21 03:50:14,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3251 treesize of output 3119 [2023-12-21 03:50:21,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 4 [2023-12-21 03:52:30,685 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 101 [2023-12-21 03:52:30,685 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-21 03:52:30,686 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 03:52:30,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-21 03:52:30,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-21 03:52:30,887 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-12-21 03:52:30,891 INFO L158 Benchmark]: Toolchain (without parser) took 206819.96ms. Allocated memory was 210.8MB in the beginning and 1.0GB in the end (delta: 800.1MB). Free memory was 166.6MB in the beginning and 542.6MB in the end (delta: -375.9MB). Peak memory consumption was 615.0MB. Max. memory is 8.0GB. [2023-12-21 03:52:30,891 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 210.8MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:52:30,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.76ms. Allocated memory is still 210.8MB. Free memory was 166.1MB in the beginning and 147.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-21 03:52:30,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.70ms. Allocated memory is still 210.8MB. Free memory was 147.7MB in the beginning and 145.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:52:30,891 INFO L158 Benchmark]: Boogie Preprocessor took 58.55ms. Allocated memory is still 210.8MB. Free memory was 145.7MB in the beginning and 142.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 03:52:30,891 INFO L158 Benchmark]: RCFGBuilder took 382.09ms. Allocated memory is still 210.8MB. Free memory was 142.0MB in the beginning and 122.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-21 03:52:30,892 INFO L158 Benchmark]: TraceAbstraction took 205974.43ms. Allocated memory was 210.8MB in the beginning and 1.0GB in the end (delta: 800.1MB). Free memory was 121.6MB in the beginning and 542.6MB in the end (delta: -421.0MB). Peak memory consumption was 569.9MB. Max. memory is 8.0GB. [2023-12-21 03:52:30,892 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.45ms. Allocated memory is still 210.8MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 366.76ms. Allocated memory is still 210.8MB. Free memory was 166.1MB in the beginning and 147.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.70ms. Allocated memory is still 210.8MB. Free memory was 147.7MB in the beginning and 145.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.55ms. Allocated memory is still 210.8MB. Free memory was 145.7MB in the beginning and 142.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 382.09ms. Allocated memory is still 210.8MB. Free memory was 142.0MB in the beginning and 122.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 205974.43ms. Allocated memory was 210.8MB in the beginning and 1.0GB in the end (delta: 800.1MB). Free memory was 121.6MB in the beginning and 542.6MB in the end (delta: -421.0MB). Peak memory consumption was 569.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...