/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/loops/insertion_sort-1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:59:46,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:59:46,147 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:59:46,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:59:46,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:59:46,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:59:46,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:59:46,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:59:46,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:59:46,164 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:59:46,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:59:46,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:59:46,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:59:46,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:59:46,165 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:59:46,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:59:46,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:59:46,166 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:59:46,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:59:46,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:59:46,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:59:46,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:59:46,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:59:46,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:59:46,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:59:46,167 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:59:46,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:59:46,168 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:59:46,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:59:46,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:59:46,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:59:46,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:59:46,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:59:46,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:59:46,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:59:46,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:59:46,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:59:46,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:59:46,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:59:46,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:59:46,171 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:59:46,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:59:46,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:59:46,171 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:59:46,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:59:46,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:59:46,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:59:46,322 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:59:46,322 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:59:46,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-1-2.c [2023-12-21 03:59:47,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:59:47,462 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:59:47,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1-2.c [2023-12-21 03:59:47,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ec8d088/ef0a6e07a31843a1b10f83f2bd7c5bcc/FLAG43b4d38c7 [2023-12-21 03:59:47,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ec8d088/ef0a6e07a31843a1b10f83f2bd7c5bcc [2023-12-21 03:59:47,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:59:47,480 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:59:47,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:59:47,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:59:47,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:59:47,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b5dfc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47, skipping insertion in model container [2023-12-21 03:59:47,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,498 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:59:47,599 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1-2.c[330,343] [2023-12-21 03:59:47,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:59:47,619 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:59:47,634 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1-2.c[330,343] [2023-12-21 03:59:47,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:59:47,654 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:59:47,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47 WrapperNode [2023-12-21 03:59:47,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:59:47,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:59:47,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:59:47,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:59:47,663 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:59:47" (1/1) ... [2023-12-21 03:59:47,670 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:59:47" (1/1) ... [2023-12-21 03:59:47,682 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2023-12-21 03:59:47,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:59:47,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:59:47,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:59:47,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:59:47,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,708 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2023-12-21 03:59:47,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:59:47,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:59:47,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:59:47,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:59:47,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (1/1) ... [2023-12-21 03:59:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:59:47,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:59:47,749 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:59:47,752 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:59:47,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:59:47,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:59:47,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:59:47,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:59:47,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:59:47,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:59:47,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:59:47,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:59:47,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:59:47,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:59:47,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:59:47,868 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:59:47,876 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:59:48,058 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:59:48,084 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:59:48,084 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 03:59:48,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:59:48 BoogieIcfgContainer [2023-12-21 03:59:48,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:59:48,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:59:48,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:59:48,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:59:48,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:59:47" (1/3) ... [2023-12-21 03:59:48,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12430111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:59:48, skipping insertion in model container [2023-12-21 03:59:48,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:59:47" (2/3) ... [2023-12-21 03:59:48,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12430111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:59:48, skipping insertion in model container [2023-12-21 03:59:48,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:59:48" (3/3) ... [2023-12-21 03:59:48,090 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-1-2.c [2023-12-21 03:59:48,102 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:59:48,103 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:59:48,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:59:48,148 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;@708e2eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:59:48,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:59:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:59:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 03:59:48,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:59:48,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:59:48,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:59:48,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:59:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1840577290, now seen corresponding path program 1 times [2023-12-21 03:59:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:59:48,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368941228] [2023-12-21 03:59:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:48,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:59:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:48,308 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:59:48,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:59:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368941228] [2023-12-21 03:59:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368941228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:59:48,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:59:48,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:59:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073185502] [2023-12-21 03:59:48,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:59:48,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 03:59:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:59:48,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 03:59:48,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:59:48,340 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:59:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:59:48,367 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2023-12-21 03:59:48,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 03:59:48,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 03:59:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:59:48,375 INFO L225 Difference]: With dead ends: 37 [2023-12-21 03:59:48,375 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 03:59:48,377 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:59:48,381 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:59:48,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:59:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 03:59:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 03:59:48,401 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:59:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-12-21 03:59:48,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2023-12-21 03:59:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:59:48,403 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-12-21 03:59:48,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:59:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-12-21 03:59:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 03:59:48,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:59:48,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:59:48,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:59:48,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:59:48,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:59:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1424335216, now seen corresponding path program 1 times [2023-12-21 03:59:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:59:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932896681] [2023-12-21 03:59:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:59:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:48,565 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:59:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:59:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932896681] [2023-12-21 03:59:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932896681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:59:48,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:59:48,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:59:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590333484] [2023-12-21 03:59:48,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:59:48,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:59:48,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:59:48,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:59:48,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:59:48,568 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:59:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:59:48,607 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2023-12-21 03:59:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:59:48,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 03:59:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:59:48,608 INFO L225 Difference]: With dead ends: 31 [2023-12-21 03:59:48,608 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 03:59:48,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:59:48,609 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:59:48,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:59:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 03:59:48,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2023-12-21 03:59:48,612 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:59:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-21 03:59:48,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2023-12-21 03:59:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:59:48,613 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-21 03:59:48,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:59:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-21 03:59:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 03:59:48,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:59:48,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:59:48,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:59:48,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:59:48,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:59:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1419415994, now seen corresponding path program 1 times [2023-12-21 03:59:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:59:48,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991302675] [2023-12-21 03:59:48,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:59:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:48,746 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:59:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:59:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991302675] [2023-12-21 03:59:48,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991302675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:59:48,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:59:48,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:59:48,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172517178] [2023-12-21 03:59:48,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:59:48,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:59:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:59:48,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:59:48,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:59:48,748 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:59:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:59:48,775 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-12-21 03:59:48,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:59:48,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-21 03:59:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:59:48,776 INFO L225 Difference]: With dead ends: 34 [2023-12-21 03:59:48,776 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 03:59:48,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:59:48,777 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:59:48,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:59:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 03:59:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-21 03:59:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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:59:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-12-21 03:59:48,780 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2023-12-21 03:59:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:59:48,781 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-12-21 03:59:48,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:59:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-12-21 03:59:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 03:59:48,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:59:48,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:59:48,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:59:48,782 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:59:48,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:59:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash 366720170, now seen corresponding path program 1 times [2023-12-21 03:59:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:59:48,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337283582] [2023-12-21 03:59:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:59:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:59:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:59:48,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337283582] [2023-12-21 03:59:48,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337283582] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:59:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856620529] [2023-12-21 03:59:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:48,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:59:48,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:59:48,955 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:59:48,981 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:59:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:49,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 03:59:49,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:59:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:59:49,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:59:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:59:49,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856620529] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:59:49,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:59:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-12-21 03:59:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294025376] [2023-12-21 03:59:49,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:59:49,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 03:59:49,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:59:49,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 03:59:49,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-21 03:59:49,191 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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:59:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:59:49,227 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2023-12-21 03:59:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 03:59:49,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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) Word has length 15 [2023-12-21 03:59:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:59:49,228 INFO L225 Difference]: With dead ends: 41 [2023-12-21 03:59:49,228 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 03:59:49,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-21 03:59:49,229 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 35 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:59:49,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:59:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 03:59:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2023-12-21 03:59:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:59:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-21 03:59:49,233 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2023-12-21 03:59:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:59:49,233 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-21 03:59:49,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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:59:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-21 03:59:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 03:59:49,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:59:49,234 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:59:49,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 03:59:49,439 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:59:49,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:59:49,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:59:49,442 INFO L85 PathProgramCache]: Analyzing trace with hash -97633594, now seen corresponding path program 2 times [2023-12-21 03:59:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:59:49,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580444045] [2023-12-21 03:59:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:49,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:59:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:59:50,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:59:50,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580444045] [2023-12-21 03:59:50,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580444045] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:59:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751773564] [2023-12-21 03:59:50,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:59:50,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:59:50,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:59:50,124 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:59:50,134 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:59:50,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:59:50,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:59:50,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 03:59:50,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:59:50,329 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 27 treesize of output 15 [2023-12-21 03:59:50,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:59:50,369 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 1 case distinctions, treesize of input 26 treesize of output 10 [2023-12-21 03:59:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:59:50,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:59:50,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-21 03:59:50,521 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-12-21 03:59:50,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 66 [2023-12-21 03:59:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:59:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751773564] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:59:50,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:59:50,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 25 [2023-12-21 03:59:50,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362763931] [2023-12-21 03:59:50,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:59:50,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-21 03:59:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:59:50,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-21 03:59:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2023-12-21 03:59:50,588 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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:59:54,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 03:59:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:59:54,995 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2023-12-21 03:59:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 03:59:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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 16 [2023-12-21 03:59:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:59:54,996 INFO L225 Difference]: With dead ends: 76 [2023-12-21 03:59:54,996 INFO L226 Difference]: Without dead ends: 63 [2023-12-21 03:59:54,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 03:59:54,997 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 109 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:59:54,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 126 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 333 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-21 03:59:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-21 03:59:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 31. [2023-12-21 03:59:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 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:59:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2023-12-21 03:59:55,002 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 16 [2023-12-21 03:59:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:59:55,002 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-12-21 03:59:55,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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:59:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2023-12-21 03:59:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 03:59:55,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:59:55,003 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:59:55,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 03:59:55,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:59:55,203 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:59:55,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:59:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash -906980220, now seen corresponding path program 1 times [2023-12-21 03:59:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:59:55,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129936553] [2023-12-21 03:59:55,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:55,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:59:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:59:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:59:55,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129936553] [2023-12-21 03:59:55,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129936553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:59:55,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:59:55,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:59:55,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461903673] [2023-12-21 03:59:55,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:59:55,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:59:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:59:55,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:59:55,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:59:55,263 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:59:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:59:55,312 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2023-12-21 03:59:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:59:55,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 16 [2023-12-21 03:59:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:59:55,314 INFO L225 Difference]: With dead ends: 69 [2023-12-21 03:59:55,314 INFO L226 Difference]: Without dead ends: 45 [2023-12-21 03:59:55,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:59:55,318 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:59:55,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:59:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-21 03:59:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2023-12-21 03:59:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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:59:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-12-21 03:59:55,331 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 16 [2023-12-21 03:59:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:59:55,331 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-12-21 03:59:55,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:59:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-12-21 03:59:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 03:59:55,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:59:55,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:59:55,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 03:59:55,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:59:55,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:59:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash -904345802, now seen corresponding path program 1 times [2023-12-21 03:59:55,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:59:55,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441324792] [2023-12-21 03:59:55,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:55,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:59:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:59:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:59:55,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441324792] [2023-12-21 03:59:55,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441324792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:59:55,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253779723] [2023-12-21 03:59:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:55,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:59:55,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:59:55,471 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:59:55,507 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:59:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:55,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 03:59:55,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:59:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:59:55,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:59:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:59:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253779723] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:59:55,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:59:55,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2023-12-21 03:59:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667030783] [2023-12-21 03:59:55,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:59:55,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 03:59:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:59:55,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 03:59:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-21 03:59:55,783 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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:59:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:59:55,897 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2023-12-21 03:59:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 03:59:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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 19 [2023-12-21 03:59:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:59:55,900 INFO L225 Difference]: With dead ends: 105 [2023-12-21 03:59:55,900 INFO L226 Difference]: Without dead ends: 74 [2023-12-21 03:59:55,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-12-21 03:59:55,901 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:59:55,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 161 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:59:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-21 03:59:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2023-12-21 03:59:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 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:59:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2023-12-21 03:59:55,907 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 19 [2023-12-21 03:59:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:59:55,907 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2023-12-21 03:59:55,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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:59:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2023-12-21 03:59:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 03:59:55,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:59:55,908 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:59:55,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-21 03:59:56,117 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:59:56,117 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:59:56,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:59:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 924268422, now seen corresponding path program 1 times [2023-12-21 03:59:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:59:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563306954] [2023-12-21 03:59:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:59:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:59:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:59:56,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563306954] [2023-12-21 03:59:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563306954] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:59:56,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765012694] [2023-12-21 03:59:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:59:56,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:59:56,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:59:56,633 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:59:56,664 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:59:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:59:56,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 03:59:56,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:59:56,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-12-21 03:59:56,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:59:56,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2023-12-21 03:59:56,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:59:56,974 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 32 treesize of output 12 [2023-12-21 03:59:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:59:56,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:00:01,636 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 72 treesize of output 64 [2023-12-21 04:00:01,646 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-12-21 04:00:01,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 564 treesize of output 504 [2023-12-21 04:00:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 04:00:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765012694] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:00:01,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:00:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 37 [2023-12-21 04:00:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500073149] [2023-12-21 04:00:01,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:00:01,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-21 04:00:01,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:00:01,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-21 04:00:01,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1157, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 04:00:01,706 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 37 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 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 04:00:06,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_24| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_~i~0#1_24| 1))) (or (forall ((v_ArrVal_85 Int)) (or (< |c_ULTIMATE.start_main_~key~0#1| v_ArrVal_85) (let ((.cse0 (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_24| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_85))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1))))) (< .cse3 |c_ULTIMATE.start_main_~i~0#1|) (< 0 .cse3)))) (forall ((v_ArrVal_85 Int)) (or (< |c_ULTIMATE.start_main_~key~0#1| v_ArrVal_85) (let ((.cse4 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_85))) (< (select .cse4 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse4 .cse1) 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (< (select .cse2 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse2 .cse1) 1)) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0))) is different from false [2023-12-21 04:00:11,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:00:23,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:00:27,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:00:31,970 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4))) (and (forall ((v_ArrVal_85 Int)) (or (< |c_ULTIMATE.start_main_~key~0#1| v_ArrVal_85) (let ((.cse0 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_85))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (< (select .cse2 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse2 .cse1) 1)))) is different from false [2023-12-21 04:00:36,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:00:38,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:00:42,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:01:03,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:01:07,628 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_24| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_~i~0#1_24| 1))) (or (forall ((v_ArrVal_85 Int)) (or (< |c_ULTIMATE.start_main_~key~0#1| v_ArrVal_85) (let ((.cse0 (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_24| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_85))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1))))) (< .cse3 |c_ULTIMATE.start_main_~i~0#1|) (< 0 .cse3)))) (forall ((v_ArrVal_85 Int)) (or (< |c_ULTIMATE.start_main_~key~0#1| v_ArrVal_85) (let ((.cse4 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_85))) (< (select .cse4 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse4 .cse1) 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= (+ (select .cse2 |c_ULTIMATE.start_main_~#v~0#1.offset|) 1) (select .cse2 .cse1)))) is different from false [2023-12-21 04:01:11,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:01:28,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:01:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:01:32,399 INFO L93 Difference]: Finished difference Result 221 states and 285 transitions. [2023-12-21 04:01:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-12-21 04:01:32,399 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 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 21 [2023-12-21 04:01:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:01:32,401 INFO L225 Difference]: With dead ends: 221 [2023-12-21 04:01:32,401 INFO L226 Difference]: Without dead ends: 161 [2023-12-21 04:01:32,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3825 ImplicationChecksByTransitivity, 59.9s TimeCoverageRelationStatistics Valid=1326, Invalid=9804, Unknown=12, NotChecked=630, Total=11772 [2023-12-21 04:01:32,404 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 226 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 80 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2023-12-21 04:01:32,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 317 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 865 Invalid, 8 Unknown, 174 Unchecked, 35.6s Time] [2023-12-21 04:01:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-21 04:01:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 54. [2023-12-21 04:01:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 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 04:01:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2023-12-21 04:01:32,420 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 21 [2023-12-21 04:01:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:01:32,420 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2023-12-21 04:01:32,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 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 04:01:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2023-12-21 04:01:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 04:01:32,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:01:32,422 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:01:32,427 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 04:01:32,627 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 04:01:32,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:01:32,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:01:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -430326836, now seen corresponding path program 3 times [2023-12-21 04:01:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:01:32,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187414918] [2023-12-21 04:01:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:01:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:01:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:01:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:01:33,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:01:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187414918] [2023-12-21 04:01:33,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187414918] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:01:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421545295] [2023-12-21 04:01:33,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 04:01:33,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:01:33,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:01:33,332 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 04:01:33,334 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 04:01:33,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 04:01:33,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:01:33,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 04:01:33,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:01:33,489 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 27 treesize of output 15 [2023-12-21 04:01:33,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 04:01:33,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 04:01:33,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:33,564 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 1 case distinctions, treesize of input 35 treesize of output 18 [2023-12-21 04:01:33,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:33,586 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 1 case distinctions, treesize of input 26 treesize of output 10 [2023-12-21 04:01:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 04:01:33,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:01:33,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2023-12-21 04:01:33,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:33,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 281 treesize of output 267 [2023-12-21 04:01:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 04:01:34,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421545295] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:01:34,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:01:34,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 32 [2023-12-21 04:01:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152841039] [2023-12-21 04:01:34,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:01:34,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 04:01:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:01:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 04:01:34,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2023-12-21 04:01:34,073 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 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 04:01:38,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:01:42,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:01:48,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:01:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:01:53,903 INFO L93 Difference]: Finished difference Result 185 states and 235 transitions. [2023-12-21 04:01:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-21 04:01:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 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 22 [2023-12-21 04:01:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:01:53,905 INFO L225 Difference]: With dead ends: 185 [2023-12-21 04:01:53,905 INFO L226 Difference]: Without dead ends: 151 [2023-12-21 04:01:53,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=755, Invalid=4356, Unknown=1, NotChecked=0, Total=5112 [2023-12-21 04:01:53,907 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 395 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 76 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2023-12-21 04:01:53,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 206 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 699 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2023-12-21 04:01:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-21 04:01:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 60. [2023-12-21 04:01:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 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 04:01:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2023-12-21 04:01:53,921 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 22 [2023-12-21 04:01:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:01:53,921 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2023-12-21 04:01:53,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 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 04:01:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2023-12-21 04:01:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 04:01:53,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:01:53,946 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:01:53,953 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 04:01:54,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:01:54,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:01:54,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:01:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash 615800944, now seen corresponding path program 2 times [2023-12-21 04:01:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:01:54,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375157494] [2023-12-21 04:01:54,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:01:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:01:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:01:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:01:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:01:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375157494] [2023-12-21 04:01:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375157494] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:01:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739712588] [2023-12-21 04:01:54,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 04:01:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:01:54,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:01:54,574 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 04:01:54,576 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 04:01:54,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 04:01:54,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:01:54,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-21 04:01:54,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:01:54,766 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 27 treesize of output 15 [2023-12-21 04:01:54,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:54,842 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 1 case distinctions, treesize of input 26 treesize of output 10 [2023-12-21 04:01:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 04:01:54,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:01:54,970 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 39 [2023-12-21 04:01:54,984 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-12-21 04:01:54,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 58 [2023-12-21 04:01:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 04:01:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739712588] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:01:55,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:01:55,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 26 [2023-12-21 04:01:55,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153362113] [2023-12-21 04:01:55,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:01:55,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 04:01:55,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:01:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 04:01:55,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-12-21 04:01:55,008 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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 04:01:59,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:03,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:07,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:11,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:16,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:20,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:24,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:28,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:40,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:02:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:02:40,173 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2023-12-21 04:02:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 04:02:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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 25 [2023-12-21 04:02:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:02:40,182 INFO L225 Difference]: With dead ends: 172 [2023-12-21 04:02:40,182 INFO L226 Difference]: Without dead ends: 150 [2023-12-21 04:02:40,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=373, Invalid=1787, Unknown=2, NotChecked=0, Total=2162 [2023-12-21 04:02:40,183 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 203 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 20 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.5s IncrementalHoareTripleChecker+Time [2023-12-21 04:02:40,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 266 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 476 Invalid, 9 Unknown, 0 Unchecked, 36.5s Time] [2023-12-21 04:02:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-21 04:02:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 93. [2023-12-21 04:02:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 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 04:02:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2023-12-21 04:02:40,198 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 25 [2023-12-21 04:02:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:02:40,198 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2023-12-21 04:02:40,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 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 04:02:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2023-12-21 04:02:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 04:02:40,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:02:40,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:02:40,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 04:02:40,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:02:40,403 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:02:40,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:02:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash 79169108, now seen corresponding path program 2 times [2023-12-21 04:02:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:02:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909779106] [2023-12-21 04:02:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:02:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:02:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:02:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:02:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:02:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909779106] [2023-12-21 04:02:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909779106] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:02:41,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729040569] [2023-12-21 04:02:41,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 04:02:41,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:02:41,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:02:41,241 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 04:02:41,241 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 04:02:41,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 04:02:41,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:02:41,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 04:02:41,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:02:41,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-12-21 04:02:41,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:02:41,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2023-12-21 04:02:41,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:02:41,675 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 1 case distinctions, treesize of input 29 treesize of output 20 [2023-12-21 04:02:41,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:02:41,726 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 1 case distinctions, treesize of input 28 treesize of output 12 [2023-12-21 04:02:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 04:02:41,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:02:54,428 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 88 treesize of output 80 [2023-12-21 04:02:54,449 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-21 04:02:54,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8510 treesize of output 8122 [2023-12-21 04:03:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 04:03:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729040569] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:03:10,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:03:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 15] total 44 [2023-12-21 04:03:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618060814] [2023-12-21 04:03:10,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:03:10,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-21 04:03:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:03:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-21 04:03:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1613, Unknown=6, NotChecked=0, Total=1892 [2023-12-21 04:03:10,806 INFO L87 Difference]: Start difference. First operand 93 states and 120 transitions. Second operand has 44 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 44 states have internal predecessors, (70), 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 04:03:15,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:03:25,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:03:29,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:03:33,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:03:37,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:03:46,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:03:54,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:04:06,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:04:28,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:04:36,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:05:06,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:05:10,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:05:15,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:05:40,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:05:44,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:05:49,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:06:13,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:06:17,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:06:21,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:06:25,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:06:29,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:06:50,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:06:54,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:06:58,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:07:02,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:07:34,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:07:38,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:07:43,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:07:47,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:07:51,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:07:55,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:07:59,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:03,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:07,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:11,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:15,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:19,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:47,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:51,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:55,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:08:59,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:03,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:07,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:11,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:15,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:19,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:23,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:27,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:31,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:36,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:40,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:44,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:48,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:09:52,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:00,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:04,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:08,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:32,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:36,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:41,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:42,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:46,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:50,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:11:54,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|))) (and (forall ((v_ArrVal_171 Int)) (let ((.cse0 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_171))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1)))) (forall ((v_ArrVal_171 Int)) (let ((.cse3 (store .cse2 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_171))) (< (select .cse3 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse3 .cse1) 1)))) (<= (select .cse2 0) (select .cse2 4)) (or (< 0 |c_ULTIMATE.start_main_~i~0#1|) (not |c_ULTIMATE.start_main_#t~short10#1|) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~j~0#1| 0)) (not (= (+ |c_ULTIMATE.start_main_~j~0#1| 1) 0)))) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0))) is different from false [2023-12-21 04:12:06,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:12:18,905 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse1 (select .cse3 4))) (and (<= .cse0 .cse1) (not (= |c_ULTIMATE.start_main_~j~0#1| 0)) (forall ((v_ArrVal_169 Int) (v_ArrVal_171 Int)) (or (< |c_ULTIMATE.start_main_~key~0#1| v_ArrVal_169) (let ((.cse2 (store (store .cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_169) (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4) 4) v_ArrVal_171))) (< (select .cse2 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) 1))))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (not (= |c_ULTIMATE.start_main_~j~0#1| 1)) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ .cse0 1) .cse1) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-12-21 04:12:22,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:12:26,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:12:59,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:13:03,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:13:07,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:13:11,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:13:15,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:13:19,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|))) (and (forall ((v_ArrVal_171 Int)) (let ((.cse0 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_171))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1)))) (forall ((v_ArrVal_171 Int)) (let ((.cse3 (store .cse2 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_171))) (< (select .cse3 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse3 .cse1) 1)))) (or (< 0 |c_ULTIMATE.start_main_~i~0#1|) (not |c_ULTIMATE.start_main_#t~short10#1|) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~j~0#1| 0)) (not (= (+ |c_ULTIMATE.start_main_~j~0#1| 1) 0)))) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (select .cse2 0) 1) (select .cse2 4)))) is different from false [2023-12-21 04:13:23,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:14:04,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:14:08,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:14:12,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:14:16,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 04:14:20,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-21 04:14:29,991 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 04:14:29,992 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 04:14:30,999 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 04:14:31,192 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 04:14:31,213 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 137 [2023-12-21 04:14:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-21 04:14:31,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5156 ImplicationChecksByTransitivity, 391.4s TimeCoverageRelationStatistics Valid=2072, Invalid=11910, Unknown=72, NotChecked=708, Total=14762 [2023-12-21 04:14:31,217 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 315 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 101 mSolverCounterUnsat, 76 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 305.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 76 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 307.1s IncrementalHoareTripleChecker+Time [2023-12-21 04:14:31,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 155 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1025 Invalid, 76 Unknown, 84 Unchecked, 307.1s Time] [2023-12-21 04:14:31,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 04:14:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 04:14:31,218 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (93states) and FLOYD_HOARE automaton (currently 86 states, 44 states before enhancement),while executing Executor. [2023-12-21 04:14:31,221 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2023-12-21 04:14:31,223 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 04:14:31,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 04:14:31 BoogieIcfgContainer [2023-12-21 04:14:31,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 04:14:31,224 INFO L158 Benchmark]: Toolchain (without parser) took 883744.43ms. Allocated memory was 220.2MB in the beginning and 349.2MB in the end (delta: 129.0MB). Free memory was 179.9MB in the beginning and 268.3MB in the end (delta: -88.4MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. [2023-12-21 04:14:31,224 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 04:14:31,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.85ms. Allocated memory is still 220.2MB. Free memory was 179.6MB in the beginning and 168.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 04:14:31,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.45ms. Allocated memory is still 220.2MB. Free memory was 168.7MB in the beginning and 167.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 04:14:31,225 INFO L158 Benchmark]: Boogie Preprocessor took 33.51ms. Allocated memory is still 220.2MB. Free memory was 167.0MB in the beginning and 164.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 04:14:31,225 INFO L158 Benchmark]: RCFGBuilder took 367.79ms. Allocated memory is still 220.2MB. Free memory was 164.9MB in the beginning and 152.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 04:14:31,225 INFO L158 Benchmark]: TraceAbstraction took 883137.87ms. Allocated memory was 220.2MB in the beginning and 349.2MB in the end (delta: 129.0MB). Free memory was 151.6MB in the beginning and 268.3MB in the end (delta: -116.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2023-12-21 04:14:31,226 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.09ms. Allocated memory is still 220.2MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.85ms. Allocated memory is still 220.2MB. Free memory was 179.6MB in the beginning and 168.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.45ms. Allocated memory is still 220.2MB. Free memory was 168.7MB in the beginning and 167.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.51ms. Allocated memory is still 220.2MB. Free memory was 167.0MB in the beginning and 164.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.79ms. Allocated memory is still 220.2MB. Free memory was 164.9MB in the beginning and 152.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 883137.87ms. Allocated memory was 220.2MB in the beginning and 349.2MB in the end (delta: 129.0MB). Free memory was 151.6MB in the beginning and 268.3MB in the end (delta: -116.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7). Cancelled while NwaCegarLoop was constructing difference of abstraction (93states) and FLOYD_HOARE automaton (currently 86 states, 44 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.1s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 840.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 97 mSolverCounterUnknown, 1366 SdHoareTripleChecker+Valid, 396.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1366 mSDsluCounter, 1449 SdHoareTripleChecker+Invalid, 394.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 258 IncrementalHoareTripleChecker+Unchecked, 1266 mSDsCounter, 316 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3662 IncrementalHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 316 mSolverCounterUnsat, 183 mSDtfsCounter, 3662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 207 SyntacticMatches, 7 SemanticMatches, 413 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 11382 ImplicationChecksByTransitivity, 468.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=10, InterpolantAutomatonStates: 225, 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, 10 MinimizatonAttempts, 326 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 40.0s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 458 ConstructedInterpolants, 30 QuantifiedInterpolants, 5204 SizeOfPredicates, 86 NumberOfNonLiveVariables, 740 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 62/203 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown