/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/dll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:44:49,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:44:49,859 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:44:49,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:44:49,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:44:49,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:44:49,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:44:49,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:44:49,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:44:49,892 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:44:49,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:44:49,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:44:49,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:44:49,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:44:49,894 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:44:49,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:44:49,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:44:49,895 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:44:49,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:44:49,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:44:49,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:44:49,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:44:49,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:44:49,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:44:49,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:44:49,898 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:44:49,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:44:49,898 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:44:49,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:44:49,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:44:49,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:44:49,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:44:49,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:44:49,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:44:49,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:44:49,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:44:49,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:44:49,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:44:49,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:44:49,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:44:49,902 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:44:49,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:44:49,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:44:49,903 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:44:50,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:44:50,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:44:50,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:44:50,156 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:44:50,156 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:44:50,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i [2023-12-21 03:44:51,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:44:51,507 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:44:51,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i [2023-12-21 03:44:51,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028e0326a/0dde5983de78441194b868b2af007114/FLAGb36720b09 [2023-12-21 03:44:51,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028e0326a/0dde5983de78441194b868b2af007114 [2023-12-21 03:44:51,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:44:51,535 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:44:51,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:44:51,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:44:51,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:44:51,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:51,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252d4ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51, skipping insertion in model container [2023-12-21 03:44:51,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:51,574 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:44:51,856 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/dll2n_update_all.i[24455,24468] [2023-12-21 03:44:51,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:44:51,873 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:44:51,916 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/dll2n_update_all.i[24455,24468] [2023-12-21 03:44:51,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:44:51,941 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:44:51,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51 WrapperNode [2023-12-21 03:44:51,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:44:51,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:44:51,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:44:51,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:44:51,949 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:44:51" (1/1) ... [2023-12-21 03:44:51,960 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:44:51" (1/1) ... [2023-12-21 03:44:51,978 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2023-12-21 03:44:51,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:44:51,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:44:51,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:44:51,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:44:51,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:51,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:51,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:52,006 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-21 03:44:52,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:52,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:52,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:52,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:52,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:52,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:52,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:44:52,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:44:52,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:44:52,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:44:52,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (1/1) ... [2023-12-21 03:44:52,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:44:52,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:44:52,069 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:44:52,079 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:44:52,104 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-21 03:44:52,104 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-21 03:44:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:44:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:44:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:44:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:44:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:44:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:44:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:44:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:44:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:44:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:44:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:44:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:44:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:44:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:44:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:44:52,212 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:44:52,214 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:44:52,245 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-21 03:44:52,369 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:44:52,394 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:44:52,394 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-21 03:44:52,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:44:52 BoogieIcfgContainer [2023-12-21 03:44:52,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:44:52,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:44:52,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:44:52,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:44:52,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:44:51" (1/3) ... [2023-12-21 03:44:52,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c615946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:44:52, skipping insertion in model container [2023-12-21 03:44:52,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:44:51" (2/3) ... [2023-12-21 03:44:52,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c615946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:44:52, skipping insertion in model container [2023-12-21 03:44:52,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:44:52" (3/3) ... [2023-12-21 03:44:52,410 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2023-12-21 03:44:52,426 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:44:52,427 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:44:52,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:44:52,472 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;@531026a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:44:52,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:44:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 03:44:52,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:52,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:52,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:52,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:52,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1931789620, now seen corresponding path program 1 times [2023-12-21 03:44:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:52,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323348227] [2023-12-21 03:44:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:52,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:52,627 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:44:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:52,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323348227] [2023-12-21 03:44:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323348227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:44:52,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:44:52,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:44:52,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914847771] [2023-12-21 03:44:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:44:52,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 03:44:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 03:44:52,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:44:52,655 INFO L87 Difference]: Start difference. First operand has 25 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:52,681 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2023-12-21 03:44:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 03:44:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 03:44:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:52,698 INFO L225 Difference]: With dead ends: 41 [2023-12-21 03:44:52,698 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 03:44:52,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:44:52,702 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:52,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 03:44:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 03:44:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-12-21 03:44:52,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 10 [2023-12-21 03:44:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:52,722 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-12-21 03:44:52,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-12-21 03:44:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 03:44:52,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:52,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:52,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:44:52,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:52,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 887365988, now seen corresponding path program 1 times [2023-12-21 03:44:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697003827] [2023-12-21 03:44:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:52,818 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:44:52,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697003827] [2023-12-21 03:44:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697003827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:44:52,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:44:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:44:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758830984] [2023-12-21 03:44:52,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:44:52,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:44:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:52,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:44:52,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:44:52,823 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:52,860 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2023-12-21 03:44:52,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:44:52,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 03:44:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:52,861 INFO L225 Difference]: With dead ends: 33 [2023-12-21 03:44:52,861 INFO L226 Difference]: Without dead ends: 22 [2023-12-21 03:44:52,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:44:52,863 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:52,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-21 03:44:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-12-21 03:44:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-21 03:44:52,867 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2023-12-21 03:44:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:52,867 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-21 03:44:52,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-21 03:44:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 03:44:52,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:52,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:52,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:44:52,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:52,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 506733128, now seen corresponding path program 1 times [2023-12-21 03:44:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913757332] [2023-12-21 03:44:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:44:53,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:53,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913757332] [2023-12-21 03:44:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913757332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:44:53,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:44:53,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:44:53,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693223045] [2023-12-21 03:44:53,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:44:53,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:44:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:53,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:44:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:44:53,017 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:53,056 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-21 03:44:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:44:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 03:44:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:53,063 INFO L225 Difference]: With dead ends: 38 [2023-12-21 03:44:53,063 INFO L226 Difference]: Without dead ends: 22 [2023-12-21 03:44:53,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:44:53,064 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:53,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-21 03:44:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-12-21 03:44:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-21 03:44:53,087 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2023-12-21 03:44:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:53,087 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-21 03:44:53,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-21 03:44:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 03:44:53,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:53,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:53,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:44:53,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:53,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1207797706, now seen corresponding path program 1 times [2023-12-21 03:44:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:53,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474930521] [2023-12-21 03:44:53,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:53,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:44:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474930521] [2023-12-21 03:44:53,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474930521] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:44:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605812836] [2023-12-21 03:44:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:53,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:53,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:44:53,241 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:44:53,244 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:44:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:53,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:44:53,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:44:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:44:53,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:44:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:44:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605812836] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:44:53,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:44:53,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-12-21 03:44:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131871664] [2023-12-21 03:44:53,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:44:53,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:44:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:53,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:44:53,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:44:53,458 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:53,493 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-12-21 03:44:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:44:53,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 03:44:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:53,494 INFO L225 Difference]: With dead ends: 34 [2023-12-21 03:44:53,494 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 03:44:53,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:44:53,501 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:53,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 03:44:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-21 03:44:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-21 03:44:53,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2023-12-21 03:44:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:53,511 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-21 03:44:53,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-21 03:44:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 03:44:53,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:53,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:53,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 03:44:53,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:53,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:53,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash -820458590, now seen corresponding path program 1 times [2023-12-21 03:44:53,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:53,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002653484] [2023-12-21 03:44:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:53,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002653484] [2023-12-21 03:44:53,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002653484] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:44:53,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:44:53,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:44:53,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526814959] [2023-12-21 03:44:53,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:44:53,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:44:53,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:53,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:44:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:44:53,862 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:53,895 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-21 03:44:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:44:53,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-21 03:44:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:53,897 INFO L225 Difference]: With dead ends: 39 [2023-12-21 03:44:53,897 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 03:44:53,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:44:53,898 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 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:44:53,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 03:44:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-12-21 03:44:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-21 03:44:53,908 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2023-12-21 03:44:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:53,908 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-21 03:44:53,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-21 03:44:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 03:44:53,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:53,910 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:53,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:44:53,910 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:53,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 707043052, now seen corresponding path program 1 times [2023-12-21 03:44:53,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431351440] [2023-12-21 03:44:53,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:54,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:54,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431351440] [2023-12-21 03:44:54,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431351440] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:44:54,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921233561] [2023-12-21 03:44:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:44:54,059 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:44:54,079 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:44:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:54,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 03:44:54,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:44:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:54,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:44:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:54,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921233561] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:44:54,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:44:54,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-12-21 03:44:54,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132057467] [2023-12-21 03:44:54,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:44:54,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 03:44:54,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:54,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 03:44:54,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-21 03:44:54,279 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:54,308 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-12-21 03:44:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:44:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-21 03:44:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:54,309 INFO L225 Difference]: With dead ends: 41 [2023-12-21 03:44:54,309 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 03:44:54,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-21 03:44:54,310 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:54,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 41 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 03:44:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2023-12-21 03:44:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-21 03:44:54,319 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2023-12-21 03:44:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:54,319 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-21 03:44:54,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-21 03:44:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 03:44:54,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:54,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:54,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 03:44:54,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-21 03:44:54,526 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:54,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:54,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1329958754, now seen corresponding path program 2 times [2023-12-21 03:44:54,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:54,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681359493] [2023-12-21 03:44:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:54,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681359493] [2023-12-21 03:44:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681359493] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:44:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289764967] [2023-12-21 03:44:54,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:44:54,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:44:54,641 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:44:54,658 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:44:54,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:44:54,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:44:54,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:44:54,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:44:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:54,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:44:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289764967] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:44:54,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:44:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-12-21 03:44:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621419647] [2023-12-21 03:44:54,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:44:54,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:44:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:44:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:44:54,845 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:54,899 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-12-21 03:44:54,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:44:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-21 03:44:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:54,902 INFO L225 Difference]: With dead ends: 44 [2023-12-21 03:44:54,902 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 03:44:54,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:44:54,903 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:54,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 03:44:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2023-12-21 03:44:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-21 03:44:54,911 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 26 [2023-12-21 03:44:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:54,912 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-21 03:44:54,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-21 03:44:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:44:54,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:54,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:54,922 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:44:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:55,119 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:55,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1493860792, now seen corresponding path program 1 times [2023-12-21 03:44:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:55,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864966438] [2023-12-21 03:44:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:44:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864966438] [2023-12-21 03:44:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864966438] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:44:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435129496] [2023-12-21 03:44:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:56,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:56,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:44:56,105 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:44:56,125 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:44:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:56,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-21 03:44:56,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:44:56,285 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:44:56,352 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:44:56,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-21 03:44:56,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-21 03:44:56,448 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:44:56,449 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 32 treesize of output 31 [2023-12-21 03:44:56,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:44:56,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-12-21 03:44:56,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 03:44:56,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-21 03:44:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:44:56,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:44:57,096 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_404) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-12-21 03:44:57,103 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_404) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-12-21 03:44:57,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:44:57,116 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 27 treesize of output 28 [2023-12-21 03:44:57,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:44:57,127 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 48 treesize of output 51 [2023-12-21 03:44:57,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-21 03:44:57,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:44:57,402 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 2 case distinctions, treesize of input 28 treesize of output 34 [2023-12-21 03:44:57,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:44:57,407 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 49 treesize of output 31 [2023-12-21 03:44:57,415 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 8 treesize of output 4 [2023-12-21 03:44:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-21 03:44:57,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435129496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:44:57,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:44:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 45 [2023-12-21 03:44:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003283167] [2023-12-21 03:44:57,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:44:57,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-21 03:44:57,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:57,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-21 03:44:57,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1638, Unknown=14, NotChecked=166, Total=1980 [2023-12-21 03:44:57,505 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:58,296 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2023-12-21 03:44:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 03:44:58,297 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-21 03:44:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:58,298 INFO L225 Difference]: With dead ends: 60 [2023-12-21 03:44:58,298 INFO L226 Difference]: Without dead ends: 58 [2023-12-21 03:44:58,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=342, Invalid=2622, Unknown=14, NotChecked=214, Total=3192 [2023-12-21 03:44:58,300 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:58,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 206 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 634 Invalid, 0 Unknown, 136 Unchecked, 0.4s Time] [2023-12-21 03:44:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-21 03:44:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2023-12-21 03:44:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-12-21 03:44:58,308 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 27 [2023-12-21 03:44:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:58,308 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-12-21 03:44:58,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-12-21 03:44:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:44:58,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:58,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:58,319 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:44:58,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:58,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:58,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash -934301861, now seen corresponding path program 1 times [2023-12-21 03:44:58,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780464932] [2023-12-21 03:44:58,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:44:58,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:58,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780464932] [2023-12-21 03:44:58,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780464932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:44:58,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:44:58,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:44:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746408907] [2023-12-21 03:44:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:44:58,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:44:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:44:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:44:58,605 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:58,633 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-12-21 03:44:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:44:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-21 03:44:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:58,636 INFO L225 Difference]: With dead ends: 52 [2023-12-21 03:44:58,636 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 03:44:58,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:44:58,638 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:58,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 03:44:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-12-21 03:44:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-21 03:44:58,649 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 28 [2023-12-21 03:44:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:58,649 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-21 03:44:58,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-21 03:44:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:44:58,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:58,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:58,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 03:44:58,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:58,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2015110622, now seen corresponding path program 2 times [2023-12-21 03:44:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:58,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679019090] [2023-12-21 03:44:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:58,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:58,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679019090] [2023-12-21 03:44:58,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679019090] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:44:58,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519616715] [2023-12-21 03:44:58,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:44:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:58,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:44:58,737 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:44:58,740 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:44:58,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:44:58,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:44:58,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 03:44:58,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:44:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:58,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:44:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:44:58,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519616715] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:44:58,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:44:58,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2023-12-21 03:44:58,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181949567] [2023-12-21 03:44:58,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:44:58,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 03:44:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 03:44:58,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:44:58,914 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:58,973 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2023-12-21 03:44:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 03:44:58,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-21 03:44:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:58,974 INFO L225 Difference]: With dead ends: 68 [2023-12-21 03:44:58,974 INFO L226 Difference]: Without dead ends: 52 [2023-12-21 03:44:58,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 03:44:58,975 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:58,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-21 03:44:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2023-12-21 03:44:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-12-21 03:44:58,994 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2023-12-21 03:44:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:58,995 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-12-21 03:44:58,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-12-21 03:44:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 03:44:58,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:58,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:59,007 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:44:59,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 03:44:59,204 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:59,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash 478338447, now seen corresponding path program 1 times [2023-12-21 03:44:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449947635] [2023-12-21 03:44:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:44:59,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:44:59,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449947635] [2023-12-21 03:44:59,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449947635] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:44:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823369286] [2023-12-21 03:44:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:59,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:59,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:44:59,281 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:44:59,300 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:44:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:44:59,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:44:59,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:44:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:44:59,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:44:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:44:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823369286] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:44:59,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:44:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-12-21 03:44:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605651419] [2023-12-21 03:44:59,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:44:59,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:44:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:44:59,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:44:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:44:59,458 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:44:59,502 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2023-12-21 03:44:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:44:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-21 03:44:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:44:59,503 INFO L225 Difference]: With dead ends: 52 [2023-12-21 03:44:59,503 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 03:44:59,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:44:59,504 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:44:59,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:44:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 03:44:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-12-21 03:44:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2023-12-21 03:44:59,511 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 31 [2023-12-21 03:44:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:44:59,511 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2023-12-21 03:44:59,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:44:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2023-12-21 03:44:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 03:44:59,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:44:59,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:44:59,520 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:44:59,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:44:59,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:44:59,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:44:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1944243812, now seen corresponding path program 1 times [2023-12-21 03:44:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:44:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650876722] [2023-12-21 03:44:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:44:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:44:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:45:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:45:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:45:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650876722] [2023-12-21 03:45:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650876722] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:45:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230147264] [2023-12-21 03:45:00,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:45:00,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:45:00,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:45:00,688 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:45:00,696 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:45:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:45:00,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-21 03:45:00,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:45:00,866 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:45:00,921 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:45:00,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-21 03:45:00,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-21 03:45:01,001 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:45:01,002 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 25 treesize of output 26 [2023-12-21 03:45:01,150 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 8 treesize of output 1 [2023-12-21 03:45:01,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:45:01,155 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 12 [2023-12-21 03:45:01,295 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:45:01,295 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 64 treesize of output 57 [2023-12-21 03:45:01,300 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 23 treesize of output 15 [2023-12-21 03:45:01,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-12-21 03:45:01,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-21 03:45:01,508 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 19 treesize of output 11 [2023-12-21 03:45:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:45:01,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:45:01,700 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 86 treesize of output 64 [2023-12-21 03:45:01,712 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_776 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_776) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_777 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.base|)))) is different from false [2023-12-21 03:45:01,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_777 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_777) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_776 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_776) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-12-21 03:45:01,859 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 215 treesize of output 191 [2023-12-21 03:45:01,865 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 93 treesize of output 85 [2023-12-21 03:45:01,870 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 85 treesize of output 81 [2023-12-21 03:45:01,897 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_773 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_773 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_773))))) is different from false [2023-12-21 03:45:02,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:45:02,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2023-12-21 03:45:02,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-12-21 03:45:02,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:45:02,191 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 38 treesize of output 30 [2023-12-21 03:45:02,195 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:45:02,196 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 8 treesize of output 4 [2023-12-21 03:45:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-21 03:45:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230147264] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:45:02,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:45:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2023-12-21 03:45:02,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343012790] [2023-12-21 03:45:02,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:45:02,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-21 03:45:02,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:45:02,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-21 03:45:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2149, Unknown=30, NotChecked=288, Total=2652 [2023-12-21 03:45:02,296 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 52 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 52 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:45:03,133 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2023-12-21 03:45:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 03:45:03,135 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 52 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-21 03:45:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:45:03,135 INFO L225 Difference]: With dead ends: 77 [2023-12-21 03:45:03,135 INFO L226 Difference]: Without dead ends: 75 [2023-12-21 03:45:03,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=3189, Unknown=31, NotChecked=354, Total=3906 [2023-12-21 03:45:03,138 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 03:45:03,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 271 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 735 Invalid, 0 Unknown, 202 Unchecked, 0.5s Time] [2023-12-21 03:45:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-21 03:45:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2023-12-21 03:45:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2023-12-21 03:45:03,146 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 32 [2023-12-21 03:45:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:45:03,146 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2023-12-21 03:45:03,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 52 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2023-12-21 03:45:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 03:45:03,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:45:03,147 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:45:03,156 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:45:03,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:45:03,354 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:45:03,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:45:03,355 INFO L85 PathProgramCache]: Analyzing trace with hash -478685482, now seen corresponding path program 3 times [2023-12-21 03:45:03,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:45:03,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083807042] [2023-12-21 03:45:03,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:45:03,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:45:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:45:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 03:45:03,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:45:03,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083807042] [2023-12-21 03:45:03,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083807042] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:45:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082106450] [2023-12-21 03:45:03,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:45:03,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:45:03,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:45:03,461 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:45:03,486 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:45:03,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 03:45:03,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:45:03,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 03:45:03,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:45:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:45:03,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:45:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:45:03,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082106450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:45:03,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:45:03,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-12-21 03:45:03,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793335140] [2023-12-21 03:45:03,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:45:03,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 03:45:03,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:45:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 03:45:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-21 03:45:03,850 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:45:03,904 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2023-12-21 03:45:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 03:45:03,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-21 03:45:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:45:03,905 INFO L225 Difference]: With dead ends: 60 [2023-12-21 03:45:03,905 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 03:45:03,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:45:03,906 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:45:03,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 49 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:45:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 03:45:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-21 03:45:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2023-12-21 03:45:03,914 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2023-12-21 03:45:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:45:03,915 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2023-12-21 03:45:03,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2023-12-21 03:45:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-21 03:45:03,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:45:03,915 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:45:03,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 03:45:04,122 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,SelfDestructingSolverStorable12 [2023-12-21 03:45:04,122 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:45:04,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:45:04,123 INFO L85 PathProgramCache]: Analyzing trace with hash 142669871, now seen corresponding path program 2 times [2023-12-21 03:45:04,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:45:04,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887148196] [2023-12-21 03:45:04,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:45:04,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:45:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:45:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:45:04,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:45:04,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887148196] [2023-12-21 03:45:04,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887148196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:45:04,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32529877] [2023-12-21 03:45:04,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:45:04,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:45:04,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:45:04,205 INFO L229 MonitoredProcess]: Starting monitored process 10 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:45:04,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 03:45:04,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:45:04,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:45:04,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 03:45:04,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:45:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 03:45:04,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:45:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 03:45:04,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32529877] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:45:04,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:45:04,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2023-12-21 03:45:04,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705586007] [2023-12-21 03:45:04,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:45:04,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 03:45:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:45:04,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 03:45:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:45:04,439 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:45:04,483 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-12-21 03:45:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 03:45:04,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-21 03:45:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:45:04,484 INFO L225 Difference]: With dead ends: 34 [2023-12-21 03:45:04,484 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 03:45:04,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:45:04,485 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:45:04,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:45:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 03:45:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 03:45:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 03:45:04,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-12-21 03:45:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:45:04,487 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 03:45:04,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:45:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 03:45:04,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 03:45:04,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 03:45:04,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 03:45:04,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 03:45:04,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 03:45:04,953 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-21 03:45:04,954 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 572 574) the Hoare annotation is: true [2023-12-21 03:45:04,954 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2023-12-21 03:45:04,954 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2023-12-21 03:45:04,954 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2023-12-21 03:45:04,954 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 624 643) no Hoare annotation was computed. [2023-12-21 03:45:04,954 INFO L902 garLoopResultBuilder]: At program point L590(line 590) the Hoare annotation is: true [2023-12-21 03:45:04,954 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 03:45:04,954 INFO L895 garLoopResultBuilder]: At program point L633-3(lines 633 638) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse5 (select .cse0 4))) (let ((.cse1 (not (= .cse5 |ULTIMATE.start_main_~s~0#1.base|))) (.cse2 (= (select (select |#memory_int#1| .cse5) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 8) 0) .cse1 .cse2 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 0)) .cse3 .cse4) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2 .cse3 .cse4))))) [2023-12-21 03:45:04,954 INFO L899 garLoopResultBuilder]: For program point L633-4(lines 633 638) no Hoare annotation was computed. [2023-12-21 03:45:04,954 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse9 (select .cse11 4))) (let ((.cse1 (= 3 |ULTIMATE.start_dll_update_at_~data#1|)) (.cse3 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 0))) (.cse0 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (= (select .cse11 8) 0)) (.cse4 (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0)) (.cse5 (not (= .cse9 |ULTIMATE.start_main_~s~0#1.base|))) (.cse10 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_dll_update_at_~index#1| 1) .cse6 .cse7 .cse8) (and (= .cse9 |ULTIMATE.start_dll_update_at_~head#1.base|) .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_dll_update_at_~head#1.offset|) .cse7 .cse8) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse2 .cse4 .cse5 .cse10 .cse7 (= 2 |ULTIMATE.start_dll_update_at_~data#1|) .cse8))))) [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 637) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 641) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 614) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse10 (select .cse9 4))) (let ((.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse1 (= |ULTIMATE.start_dll_get_data_at_~head#1.offset| 0)) (.cse8 (select |#memory_int#1| |ULTIMATE.start_dll_get_data_at_~head#1.base|)) (.cse3 (not (= .cse10 |ULTIMATE.start_main_~s~0#1.base|))) (.cse5 (= (select (select |#memory_int#1| .cse10) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) 4))) (and (= (select (select |#memory_int#1| .cse0) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.base|) 4)) 3) .cse1 .cse2 (not (= .cse0 |ULTIMATE.start_dll_get_data_at_~head#1.base|)) .cse3 .cse4 .cse5 (= |ULTIMATE.start_dll_get_data_at_~index#1| 1) .cse6 .cse7)) (and .cse2 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse3 .cse4 .cse5 (= 3 (select .cse8 |ULTIMATE.start_dll_get_data_at_~head#1.offset|)) .cse6 .cse7) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 (= (select .cse9 8) 0) (= 2 (select .cse8 0)) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse3 .cse5 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 0)) (= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse6 .cse7))))) [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point L611-3(lines 611 614) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 609) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point L595-2(lines 595 597) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L895 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse2 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (or (and (= 2 |ULTIMATE.start_dll_create_~len#1|) .cse0 .cse1 (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (and .cse2 (<= 1 |ULTIMATE.start_dll_create_~len#1|) .cse0) (let ((.cse3 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_create_~head~0#1.base|))) (and .cse2 (= (select .cse3 8) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select .cse3 4))) .cse0 .cse1)))) [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point L587-3(lines 587 600) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 624 643) no Hoare annotation was computed. [2023-12-21 03:45:04,955 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 632) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (select .cse6 4))) (let ((.cse3 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 0))) (.cse0 (= (select .cse6 8) 0)) (.cse1 (not (= .cse2 |ULTIMATE.start_main_~s~0#1.base|))) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (= (select (select |#memory_int#1| .cse2) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse4 .cse5))))) [2023-12-21 03:45:04,955 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 632) no Hoare annotation was computed. [2023-12-21 03:45:04,958 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:45:04,960 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 03:45:04,969 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-21 03:45:04,970 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,970 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-21 03:45:04,970 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-21 03:45:04,970 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,970 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-21 03:45:04,978 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][4]][#memory_$Pointer$#1.offset[~head!base][4]] could not be translated [2023-12-21 03:45:04,978 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,978 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][4] could not be translated [2023-12-21 03:45:04,978 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,978 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,979 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-21 03:45:04,979 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,979 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-21 03:45:04,979 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][~head!offset] could not be translated [2023-12-21 03:45:04,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-21 03:45:04,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0] could not be translated [2023-12-21 03:45:04,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-21 03:45:04,981 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-21 03:45:04,981 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-21 03:45:04,982 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-21 03:45:04,982 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][8] could not be translated [2023-12-21 03:45:04,982 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-21 03:45:04,983 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-21 03:45:04,983 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,983 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-21 03:45:04,983 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-21 03:45:04,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-21 03:45:04,989 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,990 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-21 03:45:04,990 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-21 03:45:04,990 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,992 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,992 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-21 03:45:04,992 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,993 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,993 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-21 03:45:04,993 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,993 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,993 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-21 03:45:04,993 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,993 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-21 03:45:04,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4] could not be translated [2023-12-21 03:45:04,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-21 03:45:04,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:45:04,994 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-21 03:45:04,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:45:04 BoogieIcfgContainer [2023-12-21 03:45:04,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 03:45:04,995 INFO L158 Benchmark]: Toolchain (without parser) took 13459.62ms. Allocated memory was 202.4MB in the beginning and 294.6MB in the end (delta: 92.3MB). Free memory was 173.5MB in the beginning and 120.7MB in the end (delta: 52.8MB). Peak memory consumption was 145.5MB. Max. memory is 8.0GB. [2023-12-21 03:45:04,996 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 202.4MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:45:04,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.31ms. Allocated memory is still 202.4MB. Free memory was 173.0MB in the beginning and 155.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 03:45:04,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.35ms. Allocated memory is still 202.4MB. Free memory was 155.1MB in the beginning and 153.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:45:04,997 INFO L158 Benchmark]: Boogie Preprocessor took 56.28ms. Allocated memory is still 202.4MB. Free memory was 153.0MB in the beginning and 150.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 03:45:04,997 INFO L158 Benchmark]: RCFGBuilder took 358.55ms. Allocated memory is still 202.4MB. Free memory was 149.9MB in the beginning and 133.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 03:45:04,998 INFO L158 Benchmark]: TraceAbstraction took 12590.38ms. Allocated memory was 202.4MB in the beginning and 294.6MB in the end (delta: 92.3MB). Free memory was 133.2MB in the beginning and 120.7MB in the end (delta: 12.5MB). Peak memory consumption was 105.7MB. Max. memory is 8.0GB. [2023-12-21 03:45:04,999 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.59ms. Allocated memory is still 202.4MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 405.31ms. Allocated memory is still 202.4MB. Free memory was 173.0MB in the beginning and 155.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.35ms. Allocated memory is still 202.4MB. Free memory was 155.1MB in the beginning and 153.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.28ms. Allocated memory is still 202.4MB. Free memory was 153.0MB in the beginning and 150.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 358.55ms. Allocated memory is still 202.4MB. Free memory was 149.9MB in the beginning and 133.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12590.38ms. Allocated memory was 202.4MB in the beginning and 294.6MB in the end (delta: 92.3MB). Free memory was 133.2MB in the beginning and 120.7MB in the end (delta: 12.5MB). Peak memory consumption was 105.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][4]][#memory_$Pointer$#1.offset[~head!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 641]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 973 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 338 IncrementalHoareTripleChecker+Unchecked, 764 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1704 IncrementalHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 209 mSDtfsCounter, 1704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 413 SyntacticMatches, 20 SemanticMatches, 172 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=12, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 86 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 24 NumberOfFragments, 558 HoareAnnotationTreeSize, 8 FormulaSimplifications, 3203 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 577 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 792 ConstructedInterpolants, 18 QuantifiedInterpolants, 3827 SizeOfPredicates, 62 NumberOfNonLiveVariables, 2328 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 32 InterpolantComputations, 5 PerfectInterpolantSequences, 318/455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || ((2 <= i) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: (((index == 1) || (index <= 0)) || (index == 0)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: ((((2 == len) && (len == 2)) || ((1 <= len) && (len == 2))) || (len == 2)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((2 <= i) && (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((3 == data) && (index == 1)) || ((3 == data) && (index <= 0))) || ((index <= 0) && (2 == data))) RESULT: Ultimate proved your program to be correct! [2023-12-21 03:45:05,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...