/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-cav19/array_init_var_plus_ind2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 20:35:17,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 20:35:17,944 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-18 20:35:17,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 20:35:17,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 20:35:17,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 20:35:17,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 20:35:17,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 20:35:17,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 20:35:17,974 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 20:35:17,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 20:35:17,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 20:35:17,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 20:35:17,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 20:35:17,976 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 20:35:17,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 20:35:17,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 20:35:17,976 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 20:35:17,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 20:35:17,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 20:35:17,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 20:35:17,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 20:35:17,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 20:35:17,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 20:35:17,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 20:35:17,979 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 20:35:17,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 20:35:17,979 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 20:35:17,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 20:35:17,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 20:35:17,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 20:35:17,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 20:35:17,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 20:35:17,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 20:35:17,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 20:35:17,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 20:35:17,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 20:35:17,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 20:35:17,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 20:35:17,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 20:35:17,982 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 20:35:17,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 20:35:17,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 20:35:17,982 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-18 20:35:18,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 20:35:18,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 20:35:18,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 20:35:18,178 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 20:35:18,180 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 20:35:18,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-cav19/array_init_var_plus_ind2.c [2023-12-18 20:35:19,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 20:35:19,370 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 20:35:19,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_var_plus_ind2.c [2023-12-18 20:35:19,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26693a27b/606f7ff91e0d40e6b4db4efacf41b2b5/FLAG5f6375325 [2023-12-18 20:35:19,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26693a27b/606f7ff91e0d40e6b4db4efacf41b2b5 [2023-12-18 20:35:19,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 20:35:19,405 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 20:35:19,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 20:35:19,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 20:35:19,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 20:35:19,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a272f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19, skipping insertion in model container [2023-12-18 20:35:19,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 20:35:19,540 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_var_plus_ind2.c[415,428] [2023-12-18 20:35:19,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 20:35:19,565 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 20:35:19,575 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_var_plus_ind2.c[415,428] [2023-12-18 20:35:19,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 20:35:19,592 INFO L206 MainTranslator]: Completed translation [2023-12-18 20:35:19,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19 WrapperNode [2023-12-18 20:35:19,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 20:35:19,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 20:35:19,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 20:35:19,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 20:35:19,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,636 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2023-12-18 20:35:19,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 20:35:19,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 20:35:19,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 20:35:19,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 20:35:19,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,658 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2023-12-18 20:35:19,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 20:35:19,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 20:35:19,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 20:35:19,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 20:35:19,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (1/1) ... [2023-12-18 20:35:19,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 20:35:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:19,702 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-18 20:35:19,721 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-18 20:35:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 20:35:19,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-18 20:35:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-18 20:35:19,795 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 20:35:19,797 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 20:35:19,918 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 20:35:19,944 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 20:35:19,944 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-18 20:35:19,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:35:19 BoogieIcfgContainer [2023-12-18 20:35:19,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 20:35:19,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 20:35:19,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 20:35:19,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 20:35:19,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:35:19" (1/3) ... [2023-12-18 20:35:19,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546366ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:35:19, skipping insertion in model container [2023-12-18 20:35:19,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:35:19" (2/3) ... [2023-12-18 20:35:19,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546366ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:35:19, skipping insertion in model container [2023-12-18 20:35:19,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:35:19" (3/3) ... [2023-12-18 20:35:19,950 INFO L112 eAbstractionObserver]: Analyzing ICFG array_init_var_plus_ind2.c [2023-12-18 20:35:19,963 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 20:35:19,965 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-18 20:35:20,001 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 20:35:20,007 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;@55afad07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 20:35:20,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-18 20:35:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-18 20:35:20,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:20,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-18 20:35:20,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:20,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1957804660, now seen corresponding path program 1 times [2023-12-18 20:35:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:20,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046385719] [2023-12-18 20:35:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:20,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:20,130 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-18 20:35:20,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:20,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046385719] [2023-12-18 20:35:20,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046385719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 20:35:20,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 20:35:20,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-18 20:35:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900828876] [2023-12-18 20:35:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 20:35:20,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-18 20:35:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:20,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-18 20:35:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-18 20:35:20,158 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 20:35:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:20,175 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2023-12-18 20:35:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-18 20:35:20,177 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-18 20:35:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:20,182 INFO L225 Difference]: With dead ends: 19 [2023-12-18 20:35:20,182 INFO L226 Difference]: Without dead ends: 9 [2023-12-18 20:35:20,184 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-18 20:35:20,188 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:20,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 20:35:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-18 20:35:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-18 20:35:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-18 20:35:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2023-12-18 20:35:20,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2023-12-18 20:35:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:20,209 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-12-18 20:35:20,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 20:35:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2023-12-18 20:35:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-18 20:35:20,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:20,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-18 20:35:20,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-18 20:35:20,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:20,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1967963391, now seen corresponding path program 1 times [2023-12-18 20:35:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:20,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767842947] [2023-12-18 20:35:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:20,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:20,329 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-18 20:35:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:20,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767842947] [2023-12-18 20:35:20,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767842947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 20:35:20,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 20:35:20,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-18 20:35:20,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600067177] [2023-12-18 20:35:20,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 20:35:20,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 20:35:20,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 20:35:20,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 20:35:20,336 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 20:35:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:20,366 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-18 20:35:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 20:35:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-18 20:35:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:20,367 INFO L225 Difference]: With dead ends: 23 [2023-12-18 20:35:20,367 INFO L226 Difference]: Without dead ends: 17 [2023-12-18 20:35:20,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 20:35:20,368 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:20,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 20:35:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-18 20:35:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 10. [2023-12-18 20:35:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-12-18 20:35:20,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2023-12-18 20:35:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:20,371 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-12-18 20:35:20,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 20:35:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-12-18 20:35:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-18 20:35:20,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:20,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-18 20:35:20,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-18 20:35:20,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:20,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -827694082, now seen corresponding path program 1 times [2023-12-18 20:35:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379130819] [2023-12-18 20:35:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:20,477 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-18 20:35:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379130819] [2023-12-18 20:35:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379130819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 20:35:20,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 20:35:20,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 20:35:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666069627] [2023-12-18 20:35:20,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 20:35:20,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 20:35:20,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:20,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 20:35:20,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-18 20:35:20,479 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:20,502 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2023-12-18 20:35:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 20:35:20,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-18 20:35:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:20,504 INFO L225 Difference]: With dead ends: 18 [2023-12-18 20:35:20,504 INFO L226 Difference]: Without dead ends: 11 [2023-12-18 20:35:20,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-18 20:35:20,505 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:20,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 20:35:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-18 20:35:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-18 20:35:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-18 20:35:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-18 20:35:20,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2023-12-18 20:35:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:20,507 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-18 20:35:20,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-18 20:35:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-18 20:35:20,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:20,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 20:35:20,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-18 20:35:20,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:20,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1244206262, now seen corresponding path program 1 times [2023-12-18 20:35:20,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:20,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888785033] [2023-12-18 20:35:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:20,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888785033] [2023-12-18 20:35:20,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888785033] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:20,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410329146] [2023-12-18 20:35:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:20,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:20,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:20,614 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-18 20:35:20,662 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-18 20:35:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:20,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-18 20:35:20,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:20,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:20,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410329146] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:20,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:20,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-12-18 20:35:20,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393256621] [2023-12-18 20:35:20,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:20,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-18 20:35:20,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:20,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-18 20:35:20,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-18 20:35:20,792 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:20,839 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-18 20:35:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-18 20:35:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-18 20:35:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:20,844 INFO L225 Difference]: With dead ends: 36 [2023-12-18 20:35:20,844 INFO L226 Difference]: Without dead ends: 28 [2023-12-18 20:35:20,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-18 20:35:20,851 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:20,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 20:35:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-18 20:35:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2023-12-18 20:35:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-18 20:35:20,854 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2023-12-18 20:35:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:20,854 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-18 20:35:20,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-18 20:35:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-18 20:35:20,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:20,855 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-12-18 20:35:20,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-18 20:35:21,062 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-18 20:35:21,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:21,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1840094996, now seen corresponding path program 1 times [2023-12-18 20:35:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252377527] [2023-12-18 20:35:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252377527] [2023-12-18 20:35:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252377527] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551395962] [2023-12-18 20:35:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:21,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:21,234 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-18 20:35:21,252 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-18 20:35:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:21,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-18 20:35:21,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:21,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-18 20:35:21,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-18 20:35:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:21,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:21,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-12-18 20:35:21,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-18 20:35:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551395962] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:21,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:21,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-12-18 20:35:21,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380691692] [2023-12-18 20:35:21,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:21,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-18 20:35:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-18 20:35:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-18 20:35:21,696 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 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-18 20:35:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:21,798 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-18 20:35:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-18 20:35:21,798 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-18 20:35:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:21,799 INFO L225 Difference]: With dead ends: 27 [2023-12-18 20:35:21,799 INFO L226 Difference]: Without dead ends: 25 [2023-12-18 20:35:21,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-12-18 20:35:21,800 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:21,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 20:35:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-18 20:35:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-12-18 20:35:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-18 20:35:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-18 20:35:21,804 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 11 [2023-12-18 20:35:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:21,805 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-18 20:35:21,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 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-18 20:35:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-18 20:35:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-18 20:35:21,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:21,805 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2023-12-18 20:35:21,824 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-18 20:35:22,012 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-18 20:35:22,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:22,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash -384854401, now seen corresponding path program 2 times [2023-12-18 20:35:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:22,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977503944] [2023-12-18 20:35:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977503944] [2023-12-18 20:35:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977503944] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728215380] [2023-12-18 20:35:22,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-18 20:35:22,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:22,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:22,258 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-18 20:35:22,280 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-18 20:35:22,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-18 20:35:22,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 20:35:22,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-18 20:35:22,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:22,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-18 20:35:22,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-18 20:35:22,414 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 11 [2023-12-18 20:35:22,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-18 20:35:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:22,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:22,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-18 20:35:22,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2023-12-18 20:35:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:22,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728215380] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:22,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:22,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2023-12-18 20:35:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194775960] [2023-12-18 20:35:22,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:22,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-18 20:35:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:22,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-18 20:35:22,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-12-18 20:35:22,653 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:22,920 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-12-18 20:35:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-18 20:35:22,920 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-18 20:35:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:22,921 INFO L225 Difference]: With dead ends: 30 [2023-12-18 20:35:22,921 INFO L226 Difference]: Without dead ends: 28 [2023-12-18 20:35:22,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-12-18 20:35:22,922 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 54 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:22,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 84 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 20:35:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-18 20:35:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2023-12-18 20:35:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-18 20:35:22,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-12-18 20:35:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:22,927 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-18 20:35:22,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-18 20:35:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-18 20:35:22,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:22,927 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 20:35:22,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-18 20:35:23,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:23,133 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:23,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1607609726, now seen corresponding path program 1 times [2023-12-18 20:35:23,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:23,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350395376] [2023-12-18 20:35:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:23,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350395376] [2023-12-18 20:35:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350395376] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536068210] [2023-12-18 20:35:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:23,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:23,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:23,200 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-18 20:35:23,202 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-18 20:35:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:23,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-18 20:35:23,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:23,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:23,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536068210] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:23,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:23,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-12-18 20:35:23,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629525394] [2023-12-18 20:35:23,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:23,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-18 20:35:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:23,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-18 20:35:23,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-18 20:35:23,307 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:23,335 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-12-18 20:35:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-18 20:35:23,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-18 20:35:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:23,338 INFO L225 Difference]: With dead ends: 28 [2023-12-18 20:35:23,338 INFO L226 Difference]: Without dead ends: 18 [2023-12-18 20:35:23,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-18 20:35:23,338 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:23,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 20:35:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-18 20:35:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-18 20:35:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-18 20:35:23,343 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2023-12-18 20:35:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:23,343 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-18 20:35:23,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-18 20:35:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-18 20:35:23,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:23,344 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 20:35:23,358 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-18 20:35:23,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:23,549 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:23,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1924564429, now seen corresponding path program 2 times [2023-12-18 20:35:23,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:23,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652263593] [2023-12-18 20:35:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:23,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:23,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652263593] [2023-12-18 20:35:23,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652263593] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:23,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918402684] [2023-12-18 20:35:23,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-18 20:35:23,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:23,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:23,757 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-18 20:35:23,772 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-18 20:35:23,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-18 20:35:23,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 20:35:23,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-18 20:35:23,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:23,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-18 20:35:23,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-18 20:35:24,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-18 20:35:24,101 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 22 treesize of output 10 [2023-12-18 20:35:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:24,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:24,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-12-18 20:35:24,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 146 [2023-12-18 20:35:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918402684] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:24,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2023-12-18 20:35:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920838394] [2023-12-18 20:35:24,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:24,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-18 20:35:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-18 20:35:24,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-12-18 20:35:24,456 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 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-18 20:35:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:24,954 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-12-18 20:35:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-18 20:35:24,955 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 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-18 20:35:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:24,955 INFO L225 Difference]: With dead ends: 37 [2023-12-18 20:35:24,955 INFO L226 Difference]: Without dead ends: 21 [2023-12-18 20:35:24,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2023-12-18 20:35:24,956 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:24,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 55 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 20:35:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-18 20:35:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-18 20:35:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 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-18 20:35:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-18 20:35:24,959 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2023-12-18 20:35:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:24,959 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-18 20:35:24,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 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-18 20:35:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-18 20:35:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-18 20:35:24,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:24,960 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 20:35:24,984 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-18 20:35:25,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:25,161 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:25,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 948814280, now seen corresponding path program 1 times [2023-12-18 20:35:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:25,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74332848] [2023-12-18 20:35:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-18 20:35:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74332848] [2023-12-18 20:35:25,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74332848] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898308256] [2023-12-18 20:35:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:25,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:25,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 20:35:25,312 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-18 20:35:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:25,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-18 20:35:25,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-18 20:35:25,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-18 20:35:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898308256] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:25,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:25,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-12-18 20:35:25,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600624230] [2023-12-18 20:35:25,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:25,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-18 20:35:25,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-18 20:35:25,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=200, Unknown=0, NotChecked=0, Total=380 [2023-12-18 20:35:25,491 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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-18 20:35:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:25,555 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2023-12-18 20:35:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 20:35:25,555 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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) Word has length 19 [2023-12-18 20:35:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:25,558 INFO L225 Difference]: With dead ends: 98 [2023-12-18 20:35:25,558 INFO L226 Difference]: Without dead ends: 90 [2023-12-18 20:35:25,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=200, Unknown=0, NotChecked=0, Total=380 [2023-12-18 20:35:25,560 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 114 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:25,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 65 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 20:35:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-18 20:35:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 34. [2023-12-18 20:35:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 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-18 20:35:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-12-18 20:35:25,571 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 19 [2023-12-18 20:35:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:25,571 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-12-18 20:35:25,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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-18 20:35:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2023-12-18 20:35:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-18 20:35:25,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:25,572 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 20:35:25,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-18 20:35:25,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:25,777 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:25,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 218650589, now seen corresponding path program 3 times [2023-12-18 20:35:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503125532] [2023-12-18 20:35:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:26,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503125532] [2023-12-18 20:35:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503125532] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214226556] [2023-12-18 20:35:26,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-18 20:35:26,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:26,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:26,155 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-18 20:35:26,199 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-18 20:35:26,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-18 20:35:26,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 20:35:26,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-18 20:35:26,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:26,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-18 20:35:26,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-18 20:35:26,338 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 11 [2023-12-18 20:35:26,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-18 20:35:26,373 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 11 [2023-12-18 20:35:26,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-18 20:35:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:26,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:30,170 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 35 treesize of output 33 [2023-12-18 20:35:30,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 278 [2023-12-18 20:35:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214226556] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:30,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2023-12-18 20:35:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945863117] [2023-12-18 20:35:30,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:30,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-18 20:35:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-18 20:35:30,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=674, Unknown=1, NotChecked=0, Total=756 [2023-12-18 20:35:30,333 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 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-18 20:35:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:30,667 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-12-18 20:35:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-18 20:35:30,668 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 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 20 [2023-12-18 20:35:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:30,669 INFO L225 Difference]: With dead ends: 40 [2023-12-18 20:35:30,669 INFO L226 Difference]: Without dead ends: 38 [2023-12-18 20:35:30,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=216, Invalid=1265, Unknown=1, NotChecked=0, Total=1482 [2023-12-18 20:35:30,670 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 81 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:30,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 51 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 20:35:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-18 20:35:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-18 20:35:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 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-18 20:35:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-18 20:35:30,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 20 [2023-12-18 20:35:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:30,675 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-18 20:35:30,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 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-18 20:35:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-18 20:35:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-18 20:35:30,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:30,675 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 3, 2, 2, 1, 1, 1, 1, 1] [2023-12-18 20:35:30,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-18 20:35:30,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:30,876 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:30,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1640508395, now seen corresponding path program 4 times [2023-12-18 20:35:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420839427] [2023-12-18 20:35:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:31,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420839427] [2023-12-18 20:35:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420839427] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:31,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436709039] [2023-12-18 20:35:31,161 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-18 20:35:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:31,178 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 20:35:31,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-18 20:35:31,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-18 20:35:31,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 20:35:31,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-18 20:35:31,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:31,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-18 20:35:31,370 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-18 20:35:31,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2023-12-18 20:35:31,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-18 20:35:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:31,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:39,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-18 20:35:39,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-12-18 20:35:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436709039] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:39,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:39,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2023-12-18 20:35:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047171334] [2023-12-18 20:35:39,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:39,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-18 20:35:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-18 20:35:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=838, Unknown=2, NotChecked=0, Total=930 [2023-12-18 20:35:39,852 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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-18 20:35:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:40,344 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-12-18 20:35:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-18 20:35:40,344 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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) Word has length 23 [2023-12-18 20:35:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:40,344 INFO L225 Difference]: With dead ends: 43 [2023-12-18 20:35:40,345 INFO L226 Difference]: Without dead ends: 41 [2023-12-18 20:35:40,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=219, Invalid=1585, Unknown=2, NotChecked=0, Total=1806 [2023-12-18 20:35:40,346 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 85 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:40,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 112 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 20:35:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-18 20:35:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-12-18 20:35:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2023-12-18 20:35:40,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 23 [2023-12-18 20:35:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:40,351 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-12-18 20:35:40,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 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-18 20:35:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2023-12-18 20:35:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-18 20:35:40,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:40,352 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2023-12-18 20:35:40,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-18 20:35:40,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-18 20:35:40,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:40,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash 52448477, now seen corresponding path program 5 times [2023-12-18 20:35:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331648070] [2023-12-18 20:35:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:40,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:40,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331648070] [2023-12-18 20:35:40,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331648070] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:40,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710084670] [2023-12-18 20:35:40,880 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-18 20:35:40,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:40,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:40,889 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 20:35:40,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-18 20:35:40,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-18 20:35:40,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 20:35:40,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-18 20:35:40,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:41,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-18 20:35:41,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-18 20:35:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:41,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:41,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-12-18 20:35:41,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-18 20:35:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710084670] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:41,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-12-18 20:35:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361207601] [2023-12-18 20:35:41,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:41,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-18 20:35:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-18 20:35:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2023-12-18 20:35:41,599 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 33 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-18 20:35:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:42,147 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-12-18 20:35:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-18 20:35:42,148 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 33 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) Word has length 26 [2023-12-18 20:35:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:42,148 INFO L225 Difference]: With dead ends: 58 [2023-12-18 20:35:42,148 INFO L226 Difference]: Without dead ends: 40 [2023-12-18 20:35:42,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=1840, Unknown=0, NotChecked=0, Total=2070 [2023-12-18 20:35:42,149 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:42,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 163 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 20:35:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-18 20:35:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-18 20:35:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 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-18 20:35:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-12-18 20:35:42,154 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2023-12-18 20:35:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:42,154 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-12-18 20:35:42,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 33 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-18 20:35:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-12-18 20:35:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-18 20:35:42,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:42,154 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 4, 3, 3, 1, 1, 1, 1, 1] [2023-12-18 20:35:42,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-18 20:35:42,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:42,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:42,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1051275794, now seen corresponding path program 6 times [2023-12-18 20:35:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642577988] [2023-12-18 20:35:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642577988] [2023-12-18 20:35:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642577988] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032858629] [2023-12-18 20:35:42,693 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-18 20:35:42,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:42,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:42,695 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 20:35:42,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-18 20:35:42,766 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-18 20:35:42,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 20:35:42,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-18 20:35:42,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:42,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-18 20:35:42,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-18 20:35:42,964 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 11 [2023-12-18 20:35:43,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-18 20:35:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:43,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:43,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-18 20:35:43,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2023-12-18 20:35:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:43,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032858629] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:43,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2023-12-18 20:35:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482794662] [2023-12-18 20:35:43,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:43,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-18 20:35:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-18 20:35:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2023-12-18 20:35:43,607 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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-18 20:35:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:44,081 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2023-12-18 20:35:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-18 20:35:44,082 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-18 20:35:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:44,082 INFO L225 Difference]: With dead ends: 46 [2023-12-18 20:35:44,082 INFO L226 Difference]: Without dead ends: 44 [2023-12-18 20:35:44,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=2354, Unknown=0, NotChecked=0, Total=2652 [2023-12-18 20:35:44,087 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 55 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:44,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 101 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 20:35:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-18 20:35:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-12-18 20:35:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-12-18 20:35:44,102 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 28 [2023-12-18 20:35:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:44,102 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-12-18 20:35:44,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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-18 20:35:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-12-18 20:35:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-18 20:35:44,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:44,104 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 4, 4, 1, 1, 1, 1, 1] [2023-12-18 20:35:44,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-18 20:35:44,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-18 20:35:44,309 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:44,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash -339160640, now seen corresponding path program 7 times [2023-12-18 20:35:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:44,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393316445] [2023-12-18 20:35:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393316445] [2023-12-18 20:35:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393316445] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901416772] [2023-12-18 20:35:44,718 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-18 20:35:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:44,719 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 20:35:44,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-18 20:35:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:44,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-18 20:35:44,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:44,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-18 20:35:45,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-18 20:35:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:45,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:45,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-12-18 20:35:45,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-18 20:35:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901416772] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:45,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2023-12-18 20:35:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384710913] [2023-12-18 20:35:45,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:45,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-18 20:35:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-18 20:35:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2023-12-18 20:35:45,500 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 40 states, 40 states have (on average 2.25) internal successors, (90), 39 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:46,261 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-12-18 20:35:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-18 20:35:46,262 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.25) internal successors, (90), 39 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-18 20:35:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:46,262 INFO L225 Difference]: With dead ends: 64 [2023-12-18 20:35:46,262 INFO L226 Difference]: Without dead ends: 43 [2023-12-18 20:35:46,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=2582, Unknown=0, NotChecked=0, Total=2862 [2023-12-18 20:35:46,263 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:46,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 210 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-18 20:35:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-18 20:35:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-18 20:35:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-12-18 20:35:46,270 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 31 [2023-12-18 20:35:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:46,271 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-12-18 20:35:46,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.25) internal successors, (90), 39 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:35:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2023-12-18 20:35:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-18 20:35:46,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:46,272 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 5, 4, 4, 1, 1, 1, 1, 1] [2023-12-18 20:35:46,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-18 20:35:46,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-18 20:35:46,477 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:46,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash -981998165, now seen corresponding path program 8 times [2023-12-18 20:35:46,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:46,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616284912] [2023-12-18 20:35:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:46,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:46,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616284912] [2023-12-18 20:35:46,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616284912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75360967] [2023-12-18 20:35:46,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-18 20:35:46,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:46,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:46,872 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 20:35:46,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-18 20:35:46,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-18 20:35:46,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 20:35:46,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-18 20:35:46,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:47,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-18 20:35:47,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-18 20:35:47,165 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 11 [2023-12-18 20:35:47,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-18 20:35:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:47,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:55,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-18 20:35:55,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-12-18 20:35:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75360967] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:55,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2023-12-18 20:35:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737332220] [2023-12-18 20:35:55,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-18 20:35:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-18 20:35:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1664, Unknown=2, NotChecked=0, Total=1806 [2023-12-18 20:35:55,907 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 42 states have internal predecessors, (96), 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-18 20:35:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:35:56,367 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-12-18 20:35:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-18 20:35:56,367 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 42 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-18 20:35:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:35:56,368 INFO L225 Difference]: With dead ends: 49 [2023-12-18 20:35:56,368 INFO L226 Difference]: Without dead ends: 47 [2023-12-18 20:35:56,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=299, Invalid=2779, Unknown=2, NotChecked=0, Total=3080 [2023-12-18 20:35:56,371 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 66 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-18 20:35:56,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 174 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-18 20:35:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-18 20:35:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-12-18 20:35:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 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-18 20:35:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-18 20:35:56,393 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 33 [2023-12-18 20:35:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:35:56,394 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-18 20:35:56,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 42 states have internal predecessors, (96), 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-18 20:35:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-18 20:35:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-18 20:35:56,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 20:35:56,398 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 5, 5, 1, 1, 1, 1, 1] [2023-12-18 20:35:56,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-18 20:35:56,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-18 20:35:56,603 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 20:35:56,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 20:35:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1679897721, now seen corresponding path program 9 times [2023-12-18 20:35:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 20:35:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079513722] [2023-12-18 20:35:56,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 20:35:56,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 20:35:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 20:35:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 20:35:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079513722] [2023-12-18 20:35:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079513722] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 20:35:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636141864] [2023-12-18 20:35:56,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-18 20:35:56,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 20:35:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 20:35:56,995 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 20:35:57,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-18 20:35:57,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-18 20:35:57,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 20:35:57,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-18 20:35:57,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 20:35:57,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-18 20:35:57,262 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-18 20:35:57,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-18 20:35:58,124 INFO L349 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2023-12-18 20:35:58,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 36 [2023-12-18 20:35:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:58,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 20:35:59,030 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 49 treesize of output 45 [2023-12-18 20:35:59,038 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-18 20:35:59,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 200 [2023-12-18 20:35:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 20:35:59,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636141864] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 20:35:59,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-18 20:35:59,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 47 [2023-12-18 20:35:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61647800] [2023-12-18 20:35:59,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-18 20:35:59,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-18 20:35:59,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 20:35:59,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-18 20:35:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1960, Unknown=0, NotChecked=0, Total=2256 [2023-12-18 20:35:59,192 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 48 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 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-18 20:36:03,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-18 20:36:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 20:36:05,605 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2023-12-18 20:36:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-18 20:36:05,606 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 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 36 [2023-12-18 20:36:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 20:36:05,606 INFO L225 Difference]: With dead ends: 67 [2023-12-18 20:36:05,606 INFO L226 Difference]: Without dead ends: 0 [2023-12-18 20:36:05,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1012, Invalid=6298, Unknown=0, NotChecked=0, Total=7310 [2023-12-18 20:36:05,608 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-18 20:36:05,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 75 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-18 20:36:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-18 20:36:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-18 20:36:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-18 20:36:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-18 20:36:05,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2023-12-18 20:36:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 20:36:05,609 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-18 20:36:05,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 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-18 20:36:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-18 20:36:05,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-18 20:36:05,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-18 20:36:05,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-18 20:36:05,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-18 20:36:05,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-18 20:36:07,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-18 20:36:07,203 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-18 20:36:07,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-12-18 20:36:07,203 INFO L895 garLoopResultBuilder]: At program point L26-3(lines 26 27) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~l~0#1| 1))) (or (and .cse0 (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse2 (+ |ULTIMATE.start_main_~l~0#1| 1)) (.cse1 (select |#memory_int#1| |ULTIMATE.start_main_~#a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~l~0#1_28| Int)) (or (< |ULTIMATE.start_main_~k~0#1| (+ (select .cse1 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~l~0#1_28| 4))) 1)) (< |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~l~0#1_28| 1)) (< |v_ULTIMATE.start_main_~l~0#1_28| .cse2))) (<= (+ |ULTIMATE.start_main_~k~0#1| 1) 0) (or (< |ULTIMATE.start_main_~k~0#1| (+ (select .cse1 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~l~0#1| 4))) 1)) (< |ULTIMATE.start_main_~i~0#1| .cse2)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select .cse1 4) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~l~0#1_28| Int)) (or (< |ULTIMATE.start_main_~k~0#1| (+ (select .cse1 (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_main_~l~0#1_28| 4))) 1)) (< |v_ULTIMATE.start_main_~l~0#1_28| 2) (< |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~l~0#1_28| 1)))))) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0))) [2023-12-18 20:36:07,203 INFO L899 garLoopResultBuilder]: For program point L26-4(lines 26 27) no Hoare annotation was computed. [2023-12-18 20:36:07,203 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-18 20:36:07,204 INFO L895 garLoopResultBuilder]: At program point L18-3(lines 18 24) the Hoare annotation is: (let ((.cse7 (select |#memory_int#1| |ULTIMATE.start_main_~#a~0#1.base|))) (let ((.cse6 (select .cse7 20))) (let ((.cse9 (= |ULTIMATE.start_main_~j~0#1| 0)) (.cse0 (<= 6 (select .cse7 16))) (.cse1 (= (select .cse7 8) 1)) (.cse2 (<= 10 .cse6)) (.cse3 (<= 3 (select .cse7 12))) (.cse8 (<= 100000 ~N~0)) (.cse4 (= (select .cse7 4) 0)) (.cse5 (= |ULTIMATE.start_main_~#a~0#1.offset| 0))) (or (and (<= (+ |ULTIMATE.start_main_~k~0#1| 15) 0) (<= 12 ~N~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 6 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (and (= 5 |v_ULTIMATE.start_main_~i~0#1_119|) (<= (+ 5 .cse6) |ULTIMATE.start_main_~j~0#1|)))) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (and (<= (+ (select .cse7 (* |v_ULTIMATE.start_main_~i~0#1_119| 4)) |v_ULTIMATE.start_main_~i~0#1_119|) |ULTIMATE.start_main_~j~0#1|) (<= 4 |v_ULTIMATE.start_main_~i~0#1_119|) (<= |v_ULTIMATE.start_main_~i~0#1_119| 5))) .cse0 .cse1 (= 5 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~k~0#1| 10) 0) (<= 10 |ULTIMATE.start_main_~j~0#1|) .cse3 .cse8 .cse4 .cse5) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (and (<= (+ (select .cse7 (* |v_ULTIMATE.start_main_~i~0#1_119| 4)) |v_ULTIMATE.start_main_~i~0#1_119|) |ULTIMATE.start_main_~j~0#1|) (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|) (<= |v_ULTIMATE.start_main_~i~0#1_119| 5))) (<= (+ 6 |ULTIMATE.start_main_~k~0#1|) 0) (= |ULTIMATE.start_main_~i~0#1| 4) .cse1 .cse3 (<= 6 |ULTIMATE.start_main_~j~0#1|) .cse8 .cse4 .cse5) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (and (<= (+ (select .cse7 (* |v_ULTIMATE.start_main_~i~0#1_119| 4)) |v_ULTIMATE.start_main_~i~0#1_119|) 0) (<= |v_ULTIMATE.start_main_~i~0#1_119| 5) (<= 0 |v_ULTIMATE.start_main_~i~0#1_119|))) (= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~k~0#1| 0) .cse8 .cse5 .cse9) (and (<= 3 |ULTIMATE.start_main_~j~0#1|) .cse1 (= 3 |ULTIMATE.start_main_~i~0#1|) (<= (+ 3 |ULTIMATE.start_main_~k~0#1|) 0) .cse8 .cse4 .cse5) (and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~k~0#1| 0) .cse8 .cse5 .cse9) (and .cse0 (<= (+ 21 |ULTIMATE.start_main_~k~0#1|) 0) .cse1 .cse2 .cse3 .cse4 .cse5 (forall ((v_ArrVal_322 Int) (|v_ULTIMATE.start_main_~l~0#1_77| Int) (|v_ULTIMATE.start_main_~l~0#1_78| Int)) (or (let ((.cse10 (store .cse7 (* |ULTIMATE.start_main_~i~0#1| 4) v_ArrVal_322))) (< (select .cse10 (* |v_ULTIMATE.start_main_~l~0#1_78| 4)) (+ (select .cse10 (* |v_ULTIMATE.start_main_~l~0#1_77| 4)) 1))) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~l~0#1_77|) (< |v_ULTIMATE.start_main_~l~0#1_77| (+ |v_ULTIMATE.start_main_~l~0#1_78| 1)) (< |v_ULTIMATE.start_main_~l~0#1_78| 5) (< v_ArrVal_322 |ULTIMATE.start_main_~j~0#1|))) (<= 6 |ULTIMATE.start_main_~i~0#1|)) (and (<= (+ |ULTIMATE.start_main_~k~0#1| 1) 0) (= 2 |ULTIMATE.start_main_~i~0#1|) .cse8 .cse4 .cse5 (= |ULTIMATE.start_main_~j~0#1| 1)))))) [2023-12-18 20:36:07,204 INFO L899 garLoopResultBuilder]: For program point L18-4(lines 18 24) no Hoare annotation was computed. [2023-12-18 20:36:07,204 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-12-18 20:36:07,204 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2023-12-18 20:36:07,204 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2023-12-18 20:36:07,206 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1, 1] [2023-12-18 20:36:07,208 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 20:36:07,223 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated [2023-12-18 20:36:07,229 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-18 20:36:07,229 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][20] could not be translated [2023-12-18 20:36:07,229 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated [2023-12-18 20:36:07,229 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-18 20:36:07,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_119 : int :: 5 == v_ULTIMATE.start_main_~i~0#1_119 && 5 + #memory_int#1[~#a~0!base][20] <= ~j~0) could not be translated [2023-12-18 20:36:07,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_119 : int :: (#memory_int#1[~#a~0!base][v_ULTIMATE.start_main_~i~0#1_119 * 4] + v_ULTIMATE.start_main_~i~0#1_119 <= ~j~0 && 4 <= v_ULTIMATE.start_main_~i~0#1_119) && v_ULTIMATE.start_main_~i~0#1_119 <= 5) could not be translated [2023-12-18 20:36:07,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated [2023-12-18 20:36:07,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-18 20:36:07,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated [2023-12-18 20:36:07,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-18 20:36:07,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_119 : int :: (#memory_int#1[~#a~0!base][v_ULTIMATE.start_main_~i~0#1_119 * 4] + v_ULTIMATE.start_main_~i~0#1_119 <= ~j~0 && 3 <= v_ULTIMATE.start_main_~i~0#1_119) && v_ULTIMATE.start_main_~i~0#1_119 <= 5) could not be translated [2023-12-18 20:36:07,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-18 20:36:07,231 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated [2023-12-18 20:36:07,231 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-18 20:36:07,231 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_119 : int :: (#memory_int#1[~#a~0!base][v_ULTIMATE.start_main_~i~0#1_119 * 4] + v_ULTIMATE.start_main_~i~0#1_119 <= 0 && v_ULTIMATE.start_main_~i~0#1_119 <= 5) && 0 <= v_ULTIMATE.start_main_~i~0#1_119) could not be translated [2023-12-18 20:36:07,231 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-18 20:36:07,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-18 20:36:07,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated [2023-12-18 20:36:07,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-18 20:36:07,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][20] could not be translated [2023-12-18 20:36:07,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated [2023-12-18 20:36:07,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-18 20:36:07,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_322 : int, v_ULTIMATE.start_main_~l~0#1_77 : int, v_ULTIMATE.start_main_~l~0#1_78 : int :: (((#memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_322][v_ULTIMATE.start_main_~l~0#1_78 * 4] < #memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_322][v_ULTIMATE.start_main_~l~0#1_77 * 4] + 1 || ~i~0 < v_ULTIMATE.start_main_~l~0#1_77) || v_ULTIMATE.start_main_~l~0#1_77 < v_ULTIMATE.start_main_~l~0#1_78 + 1) || v_ULTIMATE.start_main_~l~0#1_78 < 5) || v_ArrVal_322 < ~j~0) could not be translated [2023-12-18 20:36:07,233 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-18 20:36:07,240 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~l~0#1_28 : int :: (~k~0 < #memory_int#1[~#a~0!base][~#a~0!offset + v_ULTIMATE.start_main_~l~0#1_28 * 4] + 1 || ~i~0 < v_ULTIMATE.start_main_~l~0#1_28 + 1) || v_ULTIMATE.start_main_~l~0#1_28 < ~l~0 + 1) could not be translated [2023-12-18 20:36:07,240 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][~#a~0!offset + ~l~0 * 4] could not be translated [2023-12-18 20:36:07,240 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-18 20:36:07,240 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~l~0#1_28 : int :: (~k~0 < #memory_int#1[~#a~0!base][~#a~0!offset + v_ULTIMATE.start_main_~l~0#1_28 * 4] + 1 || v_ULTIMATE.start_main_~l~0#1_28 < 2) || ~i~0 < v_ULTIMATE.start_main_~l~0#1_28 + 1) could not be translated [2023-12-18 20:36:07,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:36:07 BoogieIcfgContainer [2023-12-18 20:36:07,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 20:36:07,241 INFO L158 Benchmark]: Toolchain (without parser) took 47836.44ms. Allocated memory was 180.4MB in the beginning and 330.3MB in the end (delta: 149.9MB). Free memory was 146.7MB in the beginning and 266.8MB in the end (delta: -120.1MB). Peak memory consumption was 189.1MB. Max. memory is 8.0GB. [2023-12-18 20:36:07,241 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 20:36:07,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.94ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 135.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-18 20:36:07,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.77ms. Allocated memory is still 180.4MB. Free memory was 134.7MB in the beginning and 133.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-18 20:36:07,242 INFO L158 Benchmark]: Boogie Preprocessor took 28.92ms. Allocated memory is still 180.4MB. Free memory was 133.5MB in the beginning and 131.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-18 20:36:07,242 INFO L158 Benchmark]: RCFGBuilder took 278.22ms. Allocated memory is still 180.4MB. Free memory was 131.6MB in the beginning and 120.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-18 20:36:07,242 INFO L158 Benchmark]: TraceAbstraction took 47294.72ms. Allocated memory was 180.4MB in the beginning and 330.3MB in the end (delta: 149.9MB). Free memory was 119.4MB in the beginning and 266.8MB in the end (delta: -147.4MB). Peak memory consumption was 161.9MB. Max. memory is 8.0GB. [2023-12-18 20:36:07,243 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.18ms. Allocated memory is still 180.4MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.94ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 135.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.77ms. Allocated memory is still 180.4MB. Free memory was 134.7MB in the beginning and 133.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.92ms. Allocated memory is still 180.4MB. Free memory was 133.5MB in the beginning and 131.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.22ms. Allocated memory is still 180.4MB. Free memory was 131.6MB in the beginning and 120.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 47294.72ms. Allocated memory was 180.4MB in the beginning and 330.3MB in the end (delta: 149.9MB). Free memory was 119.4MB in the beginning and 266.8MB in the end (delta: -147.4MB). Peak memory consumption was 161.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][20] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_119 : int :: 5 == v_ULTIMATE.start_main_~i~0#1_119 && 5 + #memory_int#1[~#a~0!base][20] <= ~j~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_119 : int :: (#memory_int#1[~#a~0!base][v_ULTIMATE.start_main_~i~0#1_119 * 4] + v_ULTIMATE.start_main_~i~0#1_119 <= ~j~0 && 4 <= v_ULTIMATE.start_main_~i~0#1_119) && v_ULTIMATE.start_main_~i~0#1_119 <= 5) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_119 : int :: (#memory_int#1[~#a~0!base][v_ULTIMATE.start_main_~i~0#1_119 * 4] + v_ULTIMATE.start_main_~i~0#1_119 <= ~j~0 && 3 <= v_ULTIMATE.start_main_~i~0#1_119) && v_ULTIMATE.start_main_~i~0#1_119 <= 5) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_119 : int :: (#memory_int#1[~#a~0!base][v_ULTIMATE.start_main_~i~0#1_119 * 4] + v_ULTIMATE.start_main_~i~0#1_119 <= 0 && v_ULTIMATE.start_main_~i~0#1_119 <= 5) && 0 <= v_ULTIMATE.start_main_~i~0#1_119) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][20] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_322 : int, v_ULTIMATE.start_main_~l~0#1_77 : int, v_ULTIMATE.start_main_~l~0#1_78 : int :: (((#memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_322][v_ULTIMATE.start_main_~l~0#1_78 * 4] < #memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_322][v_ULTIMATE.start_main_~l~0#1_77 * 4] + 1 || ~i~0 < v_ULTIMATE.start_main_~l~0#1_77) || v_ULTIMATE.start_main_~l~0#1_77 < v_ULTIMATE.start_main_~l~0#1_78 + 1) || v_ULTIMATE.start_main_~l~0#1_78 < 5) || v_ArrVal_322 < ~j~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~l~0#1_28 : int :: (~k~0 < #memory_int#1[~#a~0!base][~#a~0!offset + v_ULTIMATE.start_main_~l~0#1_28 * 4] + 1 || ~i~0 < v_ULTIMATE.start_main_~l~0#1_28 + 1) || v_ULTIMATE.start_main_~l~0#1_28 < ~l~0 + 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][~#a~0!offset + ~l~0 * 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~l~0#1_28 : int :: (~k~0 < #memory_int#1[~#a~0!base][~#a~0!offset + v_ULTIMATE.start_main_~l~0#1_28 * 4] + 1 || v_ULTIMATE.start_main_~l~0#1_28 < 2) || ~i~0 < v_ULTIMATE.start_main_~l~0#1_28 + 1) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.2s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 667 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 1243 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1138 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4532 IncrementalHoareTripleChecker+Invalid, 4598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 105 mSDtfsCounter, 4532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 807 GetRequests, 318 SyntacticMatches, 10 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4212 ImplicationChecksByTransitivity, 29.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=15, InterpolantAutomatonStates: 227, 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, 16 MinimizatonAttempts, 95 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 46 NumberOfFragments, 490 HoareAnnotationTreeSize, 2 FormulaSimplifications, 10043 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 2 FormulaSimplificationsInter, 3547 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 811 ConstructedInterpolants, 61 QuantifiedInterpolants, 10676 SizeOfPredicates, 114 NumberOfNonLiveVariables, 1840 ConjunctsInSsa, 411 ConjunctsInUnsatCore, 42 InterpolantComputations, 3 PerfectInterpolantSequences, 62/1455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((((k + 15) <= 0) && (12 <= N)) && (6 == i)) || ((((5 == i) && ((k + 10) <= 0)) && (10 <= j)) && (100000 <= N))) || (((((6 + k) <= 0) && (i == 4)) && (6 <= j)) && (100000 <= N))) || ((((i == 1) && (k <= 0)) && (100000 <= N)) && (j == 0))) || ((((3 <= j) && (3 == i)) && ((3 + k) <= 0)) && (100000 <= N))) || ((((i == 0) && (k == 0)) && (100000 <= N)) && (j == 0))) || (((21 + k) <= 0) && (6 <= i))) || (((((k + 1) <= 0) && (2 == i)) && (100000 <= N)) && (j == 1))) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((l == 1) && (100000 <= N)) && (i <= 1)) || (((k + 1) <= 0) && (2 <= i))) || ((i == 0) && (l == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-18 20:36:07,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...