/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-cav19/array_init_var_plus_ind2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 00:21:05,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 00:21:05,998 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-16 00:21:06,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 00:21:06,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 00:21:06,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 00:21:06,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 00:21:06,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 00:21:06,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 00:21:06,032 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 00:21:06,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 00:21:06,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 00:21:06,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 00:21:06,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 00:21:06,034 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 00:21:06,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 00:21:06,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 00:21:06,034 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 00:21:06,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 00:21:06,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 00:21:06,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 00:21:06,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 00:21:06,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 00:21:06,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 00:21:06,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 00:21:06,035 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 00:21:06,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 00:21:06,036 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 00:21:06,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 00:21:06,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 00:21:06,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 00:21:06,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 00:21:06,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:21:06,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 00:21:06,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 00:21:06,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 00:21:06,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 00:21:06,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 00:21:06,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 00:21:06,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 00:21:06,038 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 00:21:06,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 00:21:06,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 00:21:06,038 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 00:21:06,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 00:21:06,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 00:21:06,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 00:21:06,244 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 00:21:06,244 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 00:21:06,244 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-16 00:21:07,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 00:21:07,365 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 00:21:07,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_var_plus_ind2.c [2023-12-16 00:21:07,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d807eb4d1/6ec1a06af64849269032d2ff7a2dbafd/FLAGf9ee1aec5 [2023-12-16 00:21:07,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d807eb4d1/6ec1a06af64849269032d2ff7a2dbafd [2023-12-16 00:21:07,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 00:21:07,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 00:21:07,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 00:21:07,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 00:21:07,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 00:21:07,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d6b6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07, skipping insertion in model container [2023-12-16 00:21:07,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,405 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 00:21:07,516 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-16 00:21:07,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:21:07,541 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 00:21:07,550 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_var_plus_ind2.c[415,428] [2023-12-16 00:21:07,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:21:07,567 INFO L206 MainTranslator]: Completed translation [2023-12-16 00:21:07,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07 WrapperNode [2023-12-16 00:21:07,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 00:21:07,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 00:21:07,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 00:21:07,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 00:21:07,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,592 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2023-12-16 00:21:07,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 00:21:07,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 00:21:07,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 00:21:07,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 00:21:07,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,621 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-16 00:21:07,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 00:21:07,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 00:21:07,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 00:21:07,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 00:21:07,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (1/1) ... [2023-12-16 00:21:07,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:21:07,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:07,660 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-16 00:21:07,680 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-16 00:21:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 00:21:07,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 00:21:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 00:21:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 00:21:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 00:21:07,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 00:21:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 00:21:07,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 00:21:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 00:21:07,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 00:21:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 00:21:07,741 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 00:21:07,744 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 00:21:07,857 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 00:21:07,877 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 00:21:07,878 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 00:21:07,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:21:07 BoogieIcfgContainer [2023-12-16 00:21:07,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 00:21:07,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 00:21:07,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 00:21:07,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 00:21:07,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:21:07" (1/3) ... [2023-12-16 00:21:07,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae4c344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:21:07, skipping insertion in model container [2023-12-16 00:21:07,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:21:07" (2/3) ... [2023-12-16 00:21:07,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae4c344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:21:07, skipping insertion in model container [2023-12-16 00:21:07,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:21:07" (3/3) ... [2023-12-16 00:21:07,883 INFO L112 eAbstractionObserver]: Analyzing ICFG array_init_var_plus_ind2.c [2023-12-16 00:21:07,894 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 00:21:07,894 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 00:21:07,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 00:21:07,925 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;@f4f986b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 00:21:07,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 00:21:07,928 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-16 00:21:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 00:21:07,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:07,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 00:21:07,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:07,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1957804660, now seen corresponding path program 1 times [2023-12-16 00:21:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:07,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346960291] [2023-12-16 00:21:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:08,069 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-16 00:21:08,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346960291] [2023-12-16 00:21:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346960291] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:21:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:21:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 00:21:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972371368] [2023-12-16 00:21:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:21:08,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 00:21:08,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 00:21:08,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 00:21:08,102 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-16 00:21:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:08,132 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2023-12-16 00:21:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 00:21:08,134 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-16 00:21:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:08,138 INFO L225 Difference]: With dead ends: 19 [2023-12-16 00:21:08,138 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 00:21:08,140 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-16 00:21:08,143 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-16 00:21:08,144 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-16 00:21:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 00:21:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-16 00:21:08,163 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-16 00:21:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2023-12-16 00:21:08,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2023-12-16 00:21:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:08,165 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-12-16 00:21:08,165 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-16 00:21:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2023-12-16 00:21:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 00:21:08,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:08,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 00:21:08,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 00:21:08,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:08,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1967963391, now seen corresponding path program 1 times [2023-12-16 00:21:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:08,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158685881] [2023-12-16 00:21:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:08,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:08,268 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-16 00:21:08,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:08,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158685881] [2023-12-16 00:21:08,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158685881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:21:08,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:21:08,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 00:21:08,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365629548] [2023-12-16 00:21:08,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:21:08,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 00:21:08,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:08,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 00:21:08,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:21:08,271 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-16 00:21:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:08,297 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-16 00:21:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 00:21:08,297 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-16 00:21:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:08,298 INFO L225 Difference]: With dead ends: 23 [2023-12-16 00:21:08,298 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 00:21:08,298 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-16 00:21:08,299 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-16 00:21:08,299 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-16 00:21:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 00:21:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 10. [2023-12-16 00:21:08,302 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-16 00:21:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-12-16 00:21:08,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2023-12-16 00:21:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:08,302 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-12-16 00:21:08,302 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-16 00:21:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-12-16 00:21:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 00:21:08,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:08,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:21:08,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 00:21:08,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:08,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash -827694082, now seen corresponding path program 1 times [2023-12-16 00:21:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:08,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207149219] [2023-12-16 00:21:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:08,368 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-16 00:21:08,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:08,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207149219] [2023-12-16 00:21:08,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207149219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:21:08,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:21:08,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 00:21:08,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295003020] [2023-12-16 00:21:08,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:21:08,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:21:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:08,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:21:08,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:21:08,370 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-16 00:21:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:08,393 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2023-12-16 00:21:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:21:08,393 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-16 00:21:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:08,393 INFO L225 Difference]: With dead ends: 18 [2023-12-16 00:21:08,394 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 00:21:08,394 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-16 00:21:08,395 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-16 00:21:08,395 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-16 00:21:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 00:21:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 00:21:08,397 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-16 00:21:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-16 00:21:08,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2023-12-16 00:21:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:08,397 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-16 00:21:08,397 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-16 00:21:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-16 00:21:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 00:21:08,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:08,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:21:08,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 00:21:08,398 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:08,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1244206262, now seen corresponding path program 1 times [2023-12-16 00:21:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624922393] [2023-12-16 00:21:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:08,471 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-16 00:21:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624922393] [2023-12-16 00:21:08,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624922393] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241205145] [2023-12-16 00:21:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:08,475 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-16 00:21:08,494 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-16 00:21:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:08,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 00:21:08,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:08,585 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-16 00:21:08,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 00:21:08,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241205145] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:08,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:08,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-12-16 00:21:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877671389] [2023-12-16 00:21:08,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:08,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 00:21:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:08,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 00:21:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 00:21:08,610 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-16 00:21:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:08,648 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-16 00:21:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 00:21:08,649 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-16 00:21:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:08,649 INFO L225 Difference]: With dead ends: 36 [2023-12-16 00:21:08,649 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 00:21:08,650 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-16 00:21:08,650 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-16 00:21:08,651 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-16 00:21:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 00:21:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2023-12-16 00:21:08,653 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-16 00:21:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-16 00:21:08,654 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2023-12-16 00:21:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:08,654 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-16 00:21:08,654 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-16 00:21:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-16 00:21:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 00:21:08,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:08,655 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 00:21:08,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 00:21:08,859 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-16 00:21:08,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:08,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1840094996, now seen corresponding path program 1 times [2023-12-16 00:21:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:08,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899414596] [2023-12-16 00:21:08,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:08,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:09,182 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-16 00:21:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899414596] [2023-12-16 00:21:09,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899414596] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583401649] [2023-12-16 00:21:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:09,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:09,184 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-16 00:21:09,212 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-16 00:21:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:09,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 00:21:09,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:09,318 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-16 00:21:09,394 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-16 00:21:09,425 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-16 00:21:09,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:09,481 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-16 00:21:09,486 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-16 00:21:09,546 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-16 00:21:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583401649] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:09,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-12-16 00:21:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684545734] [2023-12-16 00:21:09,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:09,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 00:21:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:09,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 00:21:09,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-16 00:21:09,552 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-16 00:21:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:09,641 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-16 00:21:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 00:21:09,641 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-16 00:21:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:09,642 INFO L225 Difference]: With dead ends: 27 [2023-12-16 00:21:09,642 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 00:21:09,642 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-16 00:21:09,644 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.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:21:09,646 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.0s Time] [2023-12-16 00:21:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 00:21:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-12-16 00:21:09,653 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-16 00:21:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-16 00:21:09,653 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 11 [2023-12-16 00:21:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:09,653 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-16 00:21:09,653 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-16 00:21:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-16 00:21:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 00:21:09,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:09,654 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2023-12-16 00:21:09,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-16 00:21:09,858 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-16 00:21:09,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:09,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash -384854401, now seen corresponding path program 2 times [2023-12-16 00:21:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:09,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183654625] [2023-12-16 00:21:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:10,047 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-16 00:21:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183654625] [2023-12-16 00:21:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183654625] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526743008] [2023-12-16 00:21:10,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 00:21:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:10,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:10,049 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-16 00:21:10,078 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-16 00:21:10,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 00:21:10,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:21:10,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-16 00:21:10,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:10,156 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-16 00:21:10,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 00:21:10,218 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-16 00:21:10,270 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-16 00:21:10,287 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-16 00:21:10,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:10,354 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-16 00:21:10,360 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-16 00:21:10,426 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-16 00:21:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526743008] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:10,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2023-12-16 00:21:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537073230] [2023-12-16 00:21:10,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:10,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 00:21:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:10,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 00:21:10,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-12-16 00:21:10,428 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-16 00:21:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:10,676 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-12-16 00:21:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 00:21:10,677 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-16 00:21:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:10,677 INFO L225 Difference]: With dead ends: 30 [2023-12-16 00:21:10,677 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 00:21:10,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-12-16 00:21:10,678 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-16 00:21:10,678 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-16 00:21:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 00:21:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2023-12-16 00:21:10,681 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-16 00:21:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-16 00:21:10,681 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-12-16 00:21:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:10,681 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-16 00:21:10,681 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-16 00:21:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-16 00:21:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 00:21:10,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:10,682 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:21:10,687 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-16 00:21:10,885 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-16 00:21:10,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:10,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:10,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1607609726, now seen corresponding path program 1 times [2023-12-16 00:21:10,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750385295] [2023-12-16 00:21:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:10,931 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-16 00:21:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750385295] [2023-12-16 00:21:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750385295] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292922991] [2023-12-16 00:21:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:10,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:10,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:10,933 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-16 00:21:10,940 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-16 00:21:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:10,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 00:21:10,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:11,008 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-16 00:21:11,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:11,044 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-16 00:21:11,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292922991] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:11,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:11,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-12-16 00:21:11,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818912083] [2023-12-16 00:21:11,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:11,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 00:21:11,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:11,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 00:21:11,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-16 00:21:11,047 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-16 00:21:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:11,078 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-12-16 00:21:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 00:21:11,079 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-16 00:21:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:11,081 INFO L225 Difference]: With dead ends: 28 [2023-12-16 00:21:11,081 INFO L226 Difference]: Without dead ends: 18 [2023-12-16 00:21:11,081 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-16 00:21:11,082 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-16 00:21:11,082 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-16 00:21:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-16 00:21:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-16 00:21:11,086 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-16 00:21:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-16 00:21:11,086 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2023-12-16 00:21:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:11,087 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-16 00:21:11,087 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-16 00:21:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-16 00:21:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 00:21:11,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:11,087 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:21:11,092 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-16 00:21:11,292 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-16 00:21:11,292 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:11,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1924564429, now seen corresponding path program 2 times [2023-12-16 00:21:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655969905] [2023-12-16 00:21:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:11,476 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-16 00:21:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655969905] [2023-12-16 00:21:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655969905] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182855506] [2023-12-16 00:21:11,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 00:21:11,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:11,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:11,478 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-16 00:21:11,482 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-16 00:21:11,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 00:21:11,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:21:11,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-16 00:21:11,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:11,587 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-16 00:21:11,611 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-16 00:21:11,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 00:21:11,750 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-16 00:21:11,768 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-16 00:21:11,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:11,960 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-16 00:21:11,968 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-16 00:21:12,110 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-16 00:21:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182855506] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:12,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2023-12-16 00:21:12,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052043137] [2023-12-16 00:21:12,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:12,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 00:21:12,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:12,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 00:21:12,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-12-16 00:21:12,112 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-16 00:21:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:12,599 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-12-16 00:21:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 00:21:12,599 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-16 00:21:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:12,599 INFO L225 Difference]: With dead ends: 37 [2023-12-16 00:21:12,599 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 00:21:12,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 00:21:12,600 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-16 00:21:12,601 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-16 00:21:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 00:21:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 00:21:12,603 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-16 00:21:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-16 00:21:12,604 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2023-12-16 00:21:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:12,604 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-16 00:21:12,604 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-16 00:21:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-16 00:21:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 00:21:12,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:12,604 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:21:12,614 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-16 00:21:12,814 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-16 00:21:12,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:12,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:12,815 INFO L85 PathProgramCache]: Analyzing trace with hash 948814280, now seen corresponding path program 1 times [2023-12-16 00:21:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:12,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754711992] [2023-12-16 00:21:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:12,880 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-16 00:21:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754711992] [2023-12-16 00:21:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754711992] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441261608] [2023-12-16 00:21:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:12,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:12,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:12,882 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-16 00:21:12,906 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-16 00:21:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:12,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 00:21:12,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:12,987 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-16 00:21:12,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:13,033 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-16 00:21:13,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441261608] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:13,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:13,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-12-16 00:21:13,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503231417] [2023-12-16 00:21:13,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:13,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 00:21:13,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:13,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 00:21:13,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=200, Unknown=0, NotChecked=0, Total=380 [2023-12-16 00:21:13,038 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-16 00:21:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:13,092 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2023-12-16 00:21:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 00:21:13,092 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-16 00:21:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:13,092 INFO L225 Difference]: With dead ends: 98 [2023-12-16 00:21:13,093 INFO L226 Difference]: Without dead ends: 90 [2023-12-16 00:21:13,093 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-16 00:21:13,093 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-16 00:21:13,093 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-16 00:21:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-16 00:21:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 34. [2023-12-16 00:21:13,097 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-16 00:21:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-12-16 00:21:13,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 19 [2023-12-16 00:21:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:13,112 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-12-16 00:21:13,112 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-16 00:21:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2023-12-16 00:21:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 00:21:13,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:13,112 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:21:13,119 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-16 00:21:13,313 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-16 00:21:13,313 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:13,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash 218650589, now seen corresponding path program 3 times [2023-12-16 00:21:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184076900] [2023-12-16 00:21:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:13,614 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-16 00:21:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184076900] [2023-12-16 00:21:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184076900] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300302461] [2023-12-16 00:21:13,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 00:21:13,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:13,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:13,616 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-16 00:21:13,644 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-16 00:21:13,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-16 00:21:13,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:21:13,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 00:21:13,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:13,749 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-16 00:21:13,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 00:21:13,783 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-16 00:21:13,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 00:21:13,813 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-16 00:21:13,903 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-16 00:21:13,918 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-16 00:21:13,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:17,042 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-16 00:21:17,046 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-16 00:21:17,195 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-16 00:21:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300302461] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:17,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2023-12-16 00:21:17,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887712746] [2023-12-16 00:21:17,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:17,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 00:21:17,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 00:21:17,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=674, Unknown=1, NotChecked=0, Total=756 [2023-12-16 00:21:17,197 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-16 00:21:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:17,504 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-12-16 00:21:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 00:21:17,505 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-16 00:21:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:17,506 INFO L225 Difference]: With dead ends: 40 [2023-12-16 00:21:17,506 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 00:21:17,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=216, Invalid=1265, Unknown=1, NotChecked=0, Total=1482 [2023-12-16 00:21:17,507 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-16 00:21:17,507 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-16 00:21:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 00:21:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-16 00:21:17,525 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-16 00:21:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-12-16 00:21:17,525 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 20 [2023-12-16 00:21:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:17,525 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-12-16 00:21:17,525 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-16 00:21:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-12-16 00:21:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 00:21:17,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:17,526 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 3, 2, 2, 1, 1, 1, 1, 1] [2023-12-16 00:21:17,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 00:21:17,735 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-16 00:21:17,735 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:17,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1640508395, now seen corresponding path program 4 times [2023-12-16 00:21:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:17,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371972642] [2023-12-16 00:21:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:17,987 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-16 00:21:17,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371972642] [2023-12-16 00:21:17,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371972642] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220398208] [2023-12-16 00:21:17,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 00:21:17,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:17,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:17,989 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-16 00:21:18,013 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-16 00:21:18,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 00:21:18,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:21:18,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 00:21:18,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:18,117 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-16 00:21:18,155 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-16 00:21:18,156 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-16 00:21:18,261 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-16 00:21:18,282 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-16 00:21:18,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:22,445 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-16 00:21:22,448 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-16 00:21:22,587 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-16 00:21:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220398208] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:22,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:22,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2023-12-16 00:21:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199960619] [2023-12-16 00:21:22,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:22,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-16 00:21:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:22,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-16 00:21:22,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=839, Unknown=1, NotChecked=0, Total=930 [2023-12-16 00:21:22,588 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-16 00:21:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:23,043 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-12-16 00:21:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 00:21:23,045 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-16 00:21:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:23,045 INFO L225 Difference]: With dead ends: 43 [2023-12-16 00:21:23,045 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 00:21:23,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=219, Invalid=1586, Unknown=1, NotChecked=0, Total=1806 [2023-12-16 00:21:23,046 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-16 00:21:23,047 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-16 00:21:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 00:21:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-12-16 00:21:23,051 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-16 00:21:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2023-12-16 00:21:23,051 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 23 [2023-12-16 00:21:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:23,052 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-12-16 00:21:23,052 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-16 00:21:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2023-12-16 00:21:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 00:21:23,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:23,052 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2023-12-16 00:21:23,059 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-16 00:21:23,259 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-16 00:21:23,260 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:23,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash 52448477, now seen corresponding path program 5 times [2023-12-16 00:21:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:23,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995058067] [2023-12-16 00:21:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:23,607 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-16 00:21:23,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:23,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995058067] [2023-12-16 00:21:23,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995058067] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:23,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417850919] [2023-12-16 00:21:23,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 00:21:23,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:23,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:23,608 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-16 00:21:23,612 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-16 00:21:23,664 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-16 00:21:23,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:21:23,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-16 00:21:23,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:23,813 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-16 00:21:23,966 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-16 00:21:23,993 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-16 00:21:23,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:24,106 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-16 00:21:24,111 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-16 00:21:24,269 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-16 00:21:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417850919] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:24,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-12-16 00:21:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956353600] [2023-12-16 00:21:24,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:24,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-16 00:21:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-16 00:21:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 00:21:24,271 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-16 00:21:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:24,815 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-12-16 00:21:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 00:21:24,815 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-16 00:21:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:24,816 INFO L225 Difference]: With dead ends: 58 [2023-12-16 00:21:24,816 INFO L226 Difference]: Without dead ends: 40 [2023-12-16 00:21:24,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1840, Unknown=0, NotChecked=0, Total=2070 [2023-12-16 00:21:24,816 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-16 00:21:24,817 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-16 00:21:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-16 00:21:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-16 00:21:24,821 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-16 00:21:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-12-16 00:21:24,821 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2023-12-16 00:21:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:24,821 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-12-16 00:21:24,821 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-16 00:21:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-12-16 00:21:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 00:21:24,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:24,822 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 4, 3, 3, 1, 1, 1, 1, 1] [2023-12-16 00:21:24,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 00:21:25,022 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-16 00:21:25,022 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:25,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:25,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1051275794, now seen corresponding path program 6 times [2023-12-16 00:21:25,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:25,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747063805] [2023-12-16 00:21:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:25,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:25,321 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-16 00:21:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747063805] [2023-12-16 00:21:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747063805] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363227153] [2023-12-16 00:21:25,322 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 00:21:25,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:25,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:25,323 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-16 00:21:25,355 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-16 00:21:25,391 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-16 00:21:25,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:21:25,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-16 00:21:25,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:25,542 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-16 00:21:25,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 00:21:25,573 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-16 00:21:25,780 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-16 00:21:25,802 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-16 00:21:25,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:30,080 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-16 00:21:30,084 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-16 00:21:30,270 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-16 00:21:30,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363227153] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:30,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:30,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2023-12-16 00:21:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781999141] [2023-12-16 00:21:30,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:30,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-16 00:21:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:30,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-16 00:21:30,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 00:21:30,272 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-16 00:21:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:30,718 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2023-12-16 00:21:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 00:21:30,718 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-16 00:21:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:30,719 INFO L225 Difference]: With dead ends: 46 [2023-12-16 00:21:30,719 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 00:21:30,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=298, Invalid=2354, Unknown=0, NotChecked=0, Total=2652 [2023-12-16 00:21:30,720 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-16 00:21:30,720 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-16 00:21:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 00:21:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-12-16 00:21:30,725 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-16 00:21:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-12-16 00:21:30,725 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 28 [2023-12-16 00:21:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:30,725 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-12-16 00:21:30,726 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-16 00:21:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-12-16 00:21:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 00:21:30,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:30,726 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 4, 4, 1, 1, 1, 1, 1] [2023-12-16 00:21:30,733 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-16 00:21:30,930 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-16 00:21:30,931 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:30,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash -339160640, now seen corresponding path program 7 times [2023-12-16 00:21:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:30,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946540539] [2023-12-16 00:21:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:31,274 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-16 00:21:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946540539] [2023-12-16 00:21:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946540539] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503906274] [2023-12-16 00:21:31,274 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-16 00:21:31,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:31,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:31,275 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-16 00:21:31,277 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-16 00:21:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:31,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-16 00:21:31,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:31,500 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-16 00:21:31,761 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-16 00:21:31,782 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-16 00:21:31,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:31,937 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-16 00:21:31,939 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-16 00:21:32,136 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-16 00:21:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503906274] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:32,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:32,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2023-12-16 00:21:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850662450] [2023-12-16 00:21:32,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:32,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-16 00:21:32,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:32,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-16 00:21:32,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 00:21:32,143 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-16 00:21:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:32,805 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-12-16 00:21:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 00:21:32,820 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-16 00:21:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:32,822 INFO L225 Difference]: With dead ends: 64 [2023-12-16 00:21:32,822 INFO L226 Difference]: Without dead ends: 43 [2023-12-16 00:21:32,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=280, Invalid=2582, Unknown=0, NotChecked=0, Total=2862 [2023-12-16 00:21:32,823 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 00:21:32,823 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-16 00:21:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-16 00:21:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-16 00:21:32,828 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-16 00:21:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-12-16 00:21:32,828 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 31 [2023-12-16 00:21:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:32,828 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-12-16 00:21:32,828 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-16 00:21:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2023-12-16 00:21:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 00:21:32,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:32,829 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 5, 4, 4, 1, 1, 1, 1, 1] [2023-12-16 00:21:32,836 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-16 00:21:33,034 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-16 00:21:33,034 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:33,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash -981998165, now seen corresponding path program 8 times [2023-12-16 00:21:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:33,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380907823] [2023-12-16 00:21:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:33,338 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-16 00:21:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380907823] [2023-12-16 00:21:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380907823] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588687955] [2023-12-16 00:21:33,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 00:21:33,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:33,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:33,340 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-16 00:21:33,342 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-16 00:21:33,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 00:21:33,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:21:33,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-16 00:21:33,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:33,581 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-16 00:21:33,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 00:21:33,621 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-16 00:21:33,838 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-16 00:21:33,860 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-16 00:21:33,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:42,139 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-16 00:21:42,142 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-16 00:21:42,356 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-16 00:21:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588687955] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:42,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2023-12-16 00:21:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190573281] [2023-12-16 00:21:42,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:42,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-16 00:21:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-16 00:21:42,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1665, Unknown=1, NotChecked=0, Total=1806 [2023-12-16 00:21:42,358 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-16 00:21:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:42,881 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-12-16 00:21:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 00:21:42,881 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-16 00:21:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:42,882 INFO L225 Difference]: With dead ends: 49 [2023-12-16 00:21:42,882 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 00:21:42,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=299, Invalid=2780, Unknown=1, NotChecked=0, Total=3080 [2023-12-16 00:21:42,883 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.3s IncrementalHoareTripleChecker+Time [2023-12-16 00:21:42,883 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.3s Time] [2023-12-16 00:21:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 00:21:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-12-16 00:21:42,888 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-16 00:21:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-16 00:21:42,889 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 33 [2023-12-16 00:21:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:42,889 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-16 00:21:42,889 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-16 00:21:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-16 00:21:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 00:21:42,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:21:42,889 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 6, 5, 5, 1, 1, 1, 1, 1] [2023-12-16 00:21:42,896 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-16 00:21:43,094 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-16 00:21:43,094 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:21:43,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:21:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1679897721, now seen corresponding path program 9 times [2023-12-16 00:21:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:21:43,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117950972] [2023-12-16 00:21:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:21:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:21:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:21:43,498 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-16 00:21:43,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:21:43,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117950972] [2023-12-16 00:21:43,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117950972] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:21:43,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228261995] [2023-12-16 00:21:43,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 00:21:43,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:21:43,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:21:43,499 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-16 00:21:43,524 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-16 00:21:43,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-16 00:21:43,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 00:21:43,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-16 00:21:43,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:21:43,711 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-16 00:21:43,762 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-16 00:21:43,762 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-16 00:21:44,651 INFO L349 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2023-12-16 00:21:44,652 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-16 00:21:44,683 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-16 00:21:44,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:21:45,571 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-16 00:21:45,580 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 00:21:45,580 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-16 00:21:45,764 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-16 00:21:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228261995] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:21:45,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:21:45,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 47 [2023-12-16 00:21:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024005968] [2023-12-16 00:21:45,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:21:45,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-16 00:21:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:21:45,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-16 00:21:45,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1960, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 00:21:45,766 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-16 00:21:49,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-16 00:21:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:21:50,886 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2023-12-16 00:21:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-16 00:21:50,887 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-16 00:21:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:21:50,887 INFO L225 Difference]: With dead ends: 67 [2023-12-16 00:21:50,887 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 00:21:50,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1012, Invalid=6298, Unknown=0, NotChecked=0, Total=7310 [2023-12-16 00:21:50,889 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.2s IncrementalHoareTripleChecker+Time [2023-12-16 00:21:50,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 75 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-16 00:21:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 00:21:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 00:21:50,890 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-16 00:21:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 00:21:50,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2023-12-16 00:21:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:21:50,890 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 00:21:50,890 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-16 00:21:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 00:21:50,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 00:21:50,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 00:21:50,904 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-16 00:21:51,100 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-16 00:21:51,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 00:21:52,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 00:21:52,811 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 00:21:52,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-12-16 00:21:52,811 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-16 00:21:52,811 INFO L899 garLoopResultBuilder]: For program point L26-4(lines 26 27) no Hoare annotation was computed. [2023-12-16 00:21:52,811 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 00:21:52,812 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-16 00:21:52,812 INFO L899 garLoopResultBuilder]: For program point L18-4(lines 18 24) no Hoare annotation was computed. [2023-12-16 00:21:52,812 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-12-16 00:21:52,812 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2023-12-16 00:21:52,812 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2023-12-16 00:21:52,814 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1, 1] [2023-12-16 00:21:52,815 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 00:21:52,825 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated [2023-12-16 00:21:52,825 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-16 00:21:52,826 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][20] could not be translated [2023-12-16 00:21:52,826 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated [2023-12-16 00:21:52,826 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-16 00:21:52,826 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-16 00:21:52,826 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-16 00:21:52,826 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated [2023-12-16 00:21:52,826 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-16 00:21:52,826 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated [2023-12-16 00:21:52,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-16 00:21:52,827 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-16 00:21:52,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-16 00:21:52,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated [2023-12-16 00:21:52,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-16 00:21:52,827 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-16 00:21:52,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-16 00:21:52,827 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-16 00:21:52,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][16] could not be translated [2023-12-16 00:21:52,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][8] could not be translated [2023-12-16 00:21:52,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][20] could not be translated [2023-12-16 00:21:52,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][12] could not be translated [2023-12-16 00:21:52,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-16 00:21:52,828 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-16 00:21:52,828 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-16 00:21:52,830 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-16 00:21:52,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][~#a~0!offset + ~l~0 * 4] could not be translated [2023-12-16 00:21:52,830 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-16 00:21:52,830 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-16 00:21:52,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:21:52 BoogieIcfgContainer [2023-12-16 00:21:52,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 00:21:52,831 INFO L158 Benchmark]: Toolchain (without parser) took 45445.28ms. Allocated memory was 312.5MB in the beginning and 375.4MB in the end (delta: 62.9MB). Free memory was 271.1MB in the beginning and 153.5MB in the end (delta: 117.6MB). Peak memory consumption was 215.7MB. Max. memory is 8.0GB. [2023-12-16 00:21:52,831 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 192.9MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 00:21:52,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.04ms. Allocated memory is still 312.5MB. Free memory was 271.1MB in the beginning and 260.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 00:21:52,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.31ms. Allocated memory is still 312.5MB. Free memory was 260.1MB in the beginning and 258.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 00:21:52,831 INFO L158 Benchmark]: Boogie Preprocessor took 46.01ms. Allocated memory is still 312.5MB. Free memory was 258.5MB in the beginning and 256.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 00:21:52,831 INFO L158 Benchmark]: RCFGBuilder took 238.70ms. Allocated memory is still 312.5MB. Free memory was 256.9MB in the beginning and 244.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 00:21:52,831 INFO L158 Benchmark]: TraceAbstraction took 44950.88ms. Allocated memory was 312.5MB in the beginning and 375.4MB in the end (delta: 62.9MB). Free memory was 244.4MB in the beginning and 153.5MB in the end (delta: 90.9MB). Peak memory consumption was 188.4MB. Max. memory is 8.0GB. [2023-12-16 00:21:52,832 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.08ms. Allocated memory is still 192.9MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.04ms. Allocated memory is still 312.5MB. Free memory was 271.1MB in the beginning and 260.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.31ms. Allocated memory is still 312.5MB. Free memory was 260.1MB in the beginning and 258.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.01ms. Allocated memory is still 312.5MB. Free memory was 258.5MB in the beginning and 256.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 238.70ms. Allocated memory is still 312.5MB. Free memory was 256.9MB in the beginning and 244.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 44950.88ms. Allocated memory was 312.5MB in the beginning and 375.4MB in the end (delta: 62.9MB). Free memory was 244.4MB in the beginning and 153.5MB in the end (delta: 90.9MB). Peak memory consumption was 188.4MB. 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: 44.9s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 667 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 1243 SdHoareTripleChecker+Invalid, 3.6s 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, 4214 ImplicationChecksByTransitivity, 29.4s 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.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 30.1s 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-16 00:21:52,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...