/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-cav19/array_init_var_plus_ind.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 17:19:36,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 17:19:36,583 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-15 17:19:36,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 17:19:36,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 17:19:36,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 17:19:36,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 17:19:36,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 17:19:36,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 17:19:36,621 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 17:19:36,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 17:19:36,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 17:19:36,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 17:19:36,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 17:19:36,624 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 17:19:36,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 17:19:36,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 17:19:36,624 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 17:19:36,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 17:19:36,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 17:19:36,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 17:19:36,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 17:19:36,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 17:19:36,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 17:19:36,626 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 17:19:36,626 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 17:19:36,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 17:19:36,626 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 17:19:36,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 17:19:36,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 17:19:36,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 17:19:36,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 17:19:36,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 17:19:36,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 17:19:36,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 17:19:36,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 17:19:36,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 17:19:36,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 17:19:36,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 17:19:36,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 17:19:36,630 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 17:19:36,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 17:19:36,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 17:19:36,630 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 17:19:36,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 17:19:36,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 17:19:36,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 17:19:36,893 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 17:19:36,894 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 17:19:36,894 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_ind.c [2023-12-15 17:19:38,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 17:19:38,293 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 17:19:38,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_var_plus_ind.c [2023-12-15 17:19:38,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffb813be/f40d3f28c25e4c129cd1dc2f9b5e209a/FLAGdf5dc2c07 [2023-12-15 17:19:38,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffb813be/f40d3f28c25e4c129cd1dc2f9b5e209a [2023-12-15 17:19:38,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 17:19:38,317 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 17:19:38,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 17:19:38,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 17:19:38,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 17:19:38,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0270e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38, skipping insertion in model container [2023-12-15 17:19:38,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,344 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 17:19:38,462 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_ind.c[414,427] [2023-12-15 17:19:38,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 17:19:38,481 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 17:19:38,493 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_ind.c[414,427] [2023-12-15 17:19:38,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 17:19:38,512 INFO L206 MainTranslator]: Completed translation [2023-12-15 17:19:38,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38 WrapperNode [2023-12-15 17:19:38,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 17:19:38,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 17:19:38,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 17:19:38,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 17:19:38,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,536 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2023-12-15 17:19:38,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 17:19:38,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 17:19:38,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 17:19:38,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 17:19:38,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,554 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-15 17:19:38,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 17:19:38,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 17:19:38,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 17:19:38,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 17:19:38,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (1/1) ... [2023-12-15 17:19:38,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 17:19:38,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:19:38,589 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-15 17:19:38,590 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-15 17:19:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 17:19:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 17:19:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 17:19:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-15 17:19:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 17:19:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 17:19:38,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 17:19:38,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 17:19:38,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 17:19:38,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 17:19:38,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 17:19:38,668 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 17:19:38,670 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 17:19:38,778 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 17:19:38,818 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 17:19:38,818 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 17:19:38,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:19:38 BoogieIcfgContainer [2023-12-15 17:19:38,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 17:19:38,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 17:19:38,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 17:19:38,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 17:19:38,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 05:19:38" (1/3) ... [2023-12-15 17:19:38,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173ed391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 05:19:38, skipping insertion in model container [2023-12-15 17:19:38,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:19:38" (2/3) ... [2023-12-15 17:19:38,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173ed391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 05:19:38, skipping insertion in model container [2023-12-15 17:19:38,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:19:38" (3/3) ... [2023-12-15 17:19:38,833 INFO L112 eAbstractionObserver]: Analyzing ICFG array_init_var_plus_ind.c [2023-12-15 17:19:38,847 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 17:19:38,847 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 17:19:38,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 17:19:38,885 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;@3fe2a939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 17:19:38,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 17:19:38,888 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-15 17:19:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-15 17:19:38,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:19:38,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-15 17:19:38,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:19:38,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:19:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1929175509, now seen corresponding path program 1 times [2023-12-15 17:19:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:19:38,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298974572] [2023-12-15 17:19:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:19:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:39,073 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-15 17:19:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:19:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298974572] [2023-12-15 17:19:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298974572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:19:39,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:19:39,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 17:19:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183642917] [2023-12-15 17:19:39,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:19:39,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 17:19:39,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:19:39,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 17:19:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 17:19:39,119 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-15 17:19:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:19:39,158 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2023-12-15 17:19:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 17:19:39,161 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-15 17:19:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:19:39,167 INFO L225 Difference]: With dead ends: 19 [2023-12-15 17:19:39,167 INFO L226 Difference]: Without dead ends: 9 [2023-12-15 17:19:39,170 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-15 17:19:39,174 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-15 17:19:39,176 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-15 17:19:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-15 17:19:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-15 17:19:39,201 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-15 17:19:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2023-12-15 17:19:39,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2023-12-15 17:19:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:19:39,203 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-12-15 17:19:39,203 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-15 17:19:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2023-12-15 17:19:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-15 17:19:39,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:19:39,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-15 17:19:39,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 17:19:39,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:19:39,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:19:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1939334240, now seen corresponding path program 1 times [2023-12-15 17:19:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:19:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756640028] [2023-12-15 17:19:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:19:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:39,295 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-15 17:19:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:19:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756640028] [2023-12-15 17:19:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756640028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:19:39,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:19:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 17:19:39,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107822165] [2023-12-15 17:19:39,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:19:39,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:19:39,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:19:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:19:39,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 17:19:39,298 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-15 17:19:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:19:39,315 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-15 17:19:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:19:39,315 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-15 17:19:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:19:39,316 INFO L225 Difference]: With dead ends: 23 [2023-12-15 17:19:39,316 INFO L226 Difference]: Without dead ends: 17 [2023-12-15 17:19:39,316 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-15 17:19:39,318 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-15 17:19:39,318 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-15 17:19:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-15 17:19:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 10. [2023-12-15 17:19:39,321 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-15 17:19:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-12-15 17:19:39,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2023-12-15 17:19:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:19:39,322 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-12-15 17:19:39,322 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-15 17:19:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-12-15 17:19:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 17:19:39,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:19:39,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:19:39,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 17:19:39,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:19:39,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:19:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash 59809599, now seen corresponding path program 1 times [2023-12-15 17:19:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:19:39,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282095702] [2023-12-15 17:19:39,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:19:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:39,384 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-15 17:19:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:19:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282095702] [2023-12-15 17:19:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282095702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:19:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:19:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 17:19:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312780726] [2023-12-15 17:19:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:19:39,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:19:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:19:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:19:39,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 17:19:39,387 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-15 17:19:39,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:19:39,426 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2023-12-15 17:19:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:19:39,427 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-15 17:19:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:19:39,427 INFO L225 Difference]: With dead ends: 18 [2023-12-15 17:19:39,427 INFO L226 Difference]: Without dead ends: 11 [2023-12-15 17:19:39,427 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-15 17:19:39,428 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-15 17:19:39,429 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-15 17:19:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-15 17:19:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-15 17:19:39,431 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-15 17:19:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-15 17:19:39,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2023-12-15 17:19:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:19:39,432 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-15 17:19:39,432 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-15 17:19:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-15 17:19:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-15 17:19:39,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:19:39,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:19:39,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 17:19:39,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:19:39,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:19:39,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1422467303, now seen corresponding path program 1 times [2023-12-15 17:19:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:19:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710746582] [2023-12-15 17:19:39,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:19:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:39,578 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-15 17:19:39,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:19:39,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710746582] [2023-12-15 17:19:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710746582] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:19:39,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004687186] [2023-12-15 17:19:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:39,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:19:39,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:19:39,584 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-15 17:19:39,592 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-15 17:19:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:39,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 17:19:39,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:19:39,737 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-15 17:19:39,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:19:39,765 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-15 17:19:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004687186] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:19:39,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:19:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-12-15 17:19:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77394374] [2023-12-15 17:19:39,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:19:39,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 17:19:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:19:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 17:19:39,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 17:19:39,774 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-15 17:19:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:19:39,832 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-15 17:19:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 17:19:39,833 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-15 17:19:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:19:39,833 INFO L225 Difference]: With dead ends: 36 [2023-12-15 17:19:39,833 INFO L226 Difference]: Without dead ends: 28 [2023-12-15 17:19:39,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-15 17:19:39,835 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-15 17:19:39,835 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-15 17:19:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-15 17:19:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2023-12-15 17:19:39,838 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-15 17:19:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-15 17:19:39,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2023-12-15 17:19:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:19:39,839 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-15 17:19:39,839 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-15 17:19:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-15 17:19:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-15 17:19:39,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:19:39,840 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-12-15 17:19:39,851 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-15 17:19:40,046 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-15 17:19:40,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:19:40,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:19:40,047 INFO L85 PathProgramCache]: Analyzing trace with hash -572020531, now seen corresponding path program 1 times [2023-12-15 17:19:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:19:40,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906720339] [2023-12-15 17:19:40,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:40,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:19:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:40,331 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-15 17:19:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:19:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906720339] [2023-12-15 17:19:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906720339] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:19:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247837272] [2023-12-15 17:19:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:40,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:19:40,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:19:40,333 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-15 17:19:40,336 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-15 17:19:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:40,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-15 17:19:40,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:19:40,481 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-15 17:19:40,564 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-15 17:19:40,580 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-15 17:19:40,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:19:40,609 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 18 treesize of output 16 [2023-12-15 17:19:40,617 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 24 treesize of output 20 [2023-12-15 17:19:40,658 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-15 17:19:40,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247837272] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:19:40,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:19:40,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-15 17:19:40,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702887923] [2023-12-15 17:19:40,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:19:40,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 17:19:40,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:19:40,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 17:19:40,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 17:19:40,660 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:19:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:19:40,762 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-15 17:19:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 17:19:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-15 17:19:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:19:40,763 INFO L225 Difference]: With dead ends: 27 [2023-12-15 17:19:40,763 INFO L226 Difference]: Without dead ends: 25 [2023-12-15 17:19:40,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-15 17:19:40,764 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:19:40,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 52 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:19:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-15 17:19:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-12-15 17:19:40,768 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-15 17:19:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-15 17:19:40,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 11 [2023-12-15 17:19:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:19:40,769 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-15 17:19:40,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 17:19:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-15 17:19:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-15 17:19:40,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:19:40,769 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2023-12-15 17:19:40,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 17:19:40,974 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-15 17:19:40,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:19:40,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:19:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1599416564, now seen corresponding path program 2 times [2023-12-15 17:19:40,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:19:40,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850291121] [2023-12-15 17:19:40,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:40,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:19:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:41,209 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-15 17:19:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:19:41,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850291121] [2023-12-15 17:19:41,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850291121] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:19:41,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361698598] [2023-12-15 17:19:41,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 17:19:41,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:19:41,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:19:41,213 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-15 17:19:41,237 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-15 17:19:41,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 17:19:41,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 17:19:41,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-15 17:19:41,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:19:41,337 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-15 17:19:41,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 17:19:41,375 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-15 17:19:41,435 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-15 17:19:41,447 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-15 17:19:41,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:19:41,500 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 21 treesize of output 19 [2023-12-15 17:19:41,504 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 25 treesize of output 21 [2023-12-15 17:19:41,552 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-15 17:19:41,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361698598] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:19:41,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:19:41,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-12-15 17:19:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567623015] [2023-12-15 17:19:41,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:19:41,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 17:19:41,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:19:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 17:19:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-15 17:19:41,554 INFO L87 Difference]: Start difference. First operand 19 states and 22 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-15 17:19:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:19:41,649 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2023-12-15 17:19:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 17:19:41,649 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 13 [2023-12-15 17:19:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:19:41,650 INFO L225 Difference]: With dead ends: 24 [2023-12-15 17:19:41,650 INFO L226 Difference]: Without dead ends: 22 [2023-12-15 17:19:41,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-15 17:19:41,651 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:19:41,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:19:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-15 17:19:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-12-15 17:19:41,656 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-15 17:19:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-15 17:19:41,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-12-15 17:19:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:19:41,657 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-15 17:19:41,657 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-15 17:19:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-15 17:19:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-15 17:19:41,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:19:41,658 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:19:41,668 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-15 17:19:41,863 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-15 17:19:41,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:19:41,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:19:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1371804036, now seen corresponding path program 1 times [2023-12-15 17:19:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:19:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758707204] [2023-12-15 17:19:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:19:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:41,917 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-15 17:19:41,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:19:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758707204] [2023-12-15 17:19:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758707204] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:19:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972433522] [2023-12-15 17:19:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:41,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:19:41,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:19:41,919 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-15 17:19:41,932 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-15 17:19:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:41,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 17:19:41,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:19:42,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-15 17:19:42,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:19:42,041 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-15 17:19:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972433522] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:19:42,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:19:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-12-15 17:19:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404815085] [2023-12-15 17:19:42,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:19:42,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 17:19:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:19:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 17:19:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-15 17:19:42,043 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-15 17:19:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:19:42,075 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-12-15 17:19:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 17:19:42,076 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-15 17:19:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:19:42,077 INFO L225 Difference]: With dead ends: 28 [2023-12-15 17:19:42,077 INFO L226 Difference]: Without dead ends: 18 [2023-12-15 17:19:42,077 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-15 17:19:42,078 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 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-15 17:19:42,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:19:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-15 17:19:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-15 17:19:42,081 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-15 17:19:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-15 17:19:42,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2023-12-15 17:19:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:19:42,082 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-15 17:19:42,082 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-15 17:19:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-15 17:19:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-15 17:19:42,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:19:42,083 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:19:42,090 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-15 17:19:42,287 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-15 17:19:42,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:19:42,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:19:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -143111171, now seen corresponding path program 2 times [2023-12-15 17:19:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:19:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6700418] [2023-12-15 17:19:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:19:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:19:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:19:42,521 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-15 17:19:42,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:19:42,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6700418] [2023-12-15 17:19:42,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6700418] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:19:42,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881153415] [2023-12-15 17:19:42,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 17:19:42,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:19:42,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:19:42,523 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-15 17:19:42,533 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-15 17:19:42,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 17:19:42,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 17:19:42,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-15 17:19:42,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:19:42,646 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-15 17:19:42,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-12-15 17:19:42,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 17:19:42,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-12-15 17:19:42,861 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-15 17:19:42,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 17:19:43,179 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 53 treesize of output 49 [2023-12-15 17:19:43,196 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 17:19:43,197 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 109 treesize of output 99 [2023-12-15 17:19:43,332 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-15 17:19:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881153415] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 17:19:43,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 17:19:43,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 24 [2023-12-15 17:19:43,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517147375] [2023-12-15 17:19:43,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 17:19:43,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-15 17:19:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:19:43,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-15 17:19:43,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2023-12-15 17:19:43,336 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 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-15 17:19:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:19:43,951 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-12-15 17:19:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 17:19:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 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-15 17:19:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:19:43,952 INFO L225 Difference]: With dead ends: 27 [2023-12-15 17:19:43,952 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 17:19:43,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2023-12-15 17:19:43,953 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:19:43,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:19:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 17:19:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 17:19:43,954 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-15 17:19:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 17:19:43,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2023-12-15 17:19:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:19:43,955 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 17:19:43,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 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-15 17:19:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 17:19:43,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 17:19:43,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 17:19:43,966 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-15 17:19:44,163 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-15 17:19:44,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 17:19:44,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 17:19:44,423 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 17:19:44,424 INFO L895 garLoopResultBuilder]: At program point L17-3(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 100000 ~N~0)) (.cse1 (= |ULTIMATE.start_main_~#a~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 (= |ULTIMATE.start_main_~j~0#1| 0)) (and (= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |ULTIMATE.start_main_~j~0#1|) .cse0 .cse1) (let ((.cse2 (select |#memory_int#1| |ULTIMATE.start_main_~#a~0#1.base|))) (and (<= 0 (select .cse2 4)) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse1 (forall ((v_ArrVal_80 Int) (|v_ULTIMATE.start_main_~k~0#1_28| Int)) (let ((.cse3 (store .cse2 (* |ULTIMATE.start_main_~i~0#1| 4) v_ArrVal_80))) (or (< (select .cse3 4) 0) (< 0 (+ (select .cse3 (* 4 |v_ULTIMATE.start_main_~k~0#1_28|)) 1)) (< |v_ULTIMATE.start_main_~k~0#1_28| 2) (< v_ArrVal_80 |ULTIMATE.start_main_~j~0#1|) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_28|)))))))) [2023-12-15 17:19:44,424 INFO L899 garLoopResultBuilder]: For program point L17-4(lines 17 22) no Hoare annotation was computed. [2023-12-15 17:19:44,424 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 17:19:44,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-12-15 17:19:44,424 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 25) the Hoare annotation is: (let ((.cse4 (select |#memory_int#1| |ULTIMATE.start_main_~#a~0#1.base|))) (let ((.cse1 (= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse2 (<= 0 (select .cse4 4))) (.cse3 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse0 (= |ULTIMATE.start_main_~k~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0)) (let ((.cse5 (+ |ULTIMATE.start_main_~k~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~k~0#1_28| Int)) (or (< 0 (+ (select .cse4 (* 4 |v_ULTIMATE.start_main_~k~0#1_28|)) 1)) (< |v_ULTIMATE.start_main_~k~0#1_28| .cse5) (< |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~k~0#1_28| 1)))) .cse2 (or (< |ULTIMATE.start_main_~i~0#1| .cse5) (< 0 (+ 1 (select .cse4 (* |ULTIMATE.start_main_~k~0#1| 4))))) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3 (forall ((v_ArrVal_80 Int) (|v_ULTIMATE.start_main_~k~0#1_28| Int)) (let ((.cse6 (store .cse4 (* |ULTIMATE.start_main_~i~0#1| 4) v_ArrVal_80))) (or (< (select .cse6 4) 0) (< 0 (+ (select .cse6 (* 4 |v_ULTIMATE.start_main_~k~0#1_28|)) 1)) (< |v_ULTIMATE.start_main_~k~0#1_28| 2) (< v_ArrVal_80 |ULTIMATE.start_main_~j~0#1|) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_28|)))))) (and (<= 2 |ULTIMATE.start_main_~k~0#1|) .cse1 .cse2 .cse3) (and .cse0 (<= 100000 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))))) [2023-12-15 17:19:44,425 INFO L899 garLoopResultBuilder]: For program point L24-4(lines 24 25) no Hoare annotation was computed. [2023-12-15 17:19:44,425 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-12-15 17:19:44,425 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2023-12-15 17:19:44,425 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2023-12-15 17:19:44,428 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-12-15 17:19:44,430 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 17:19:44,442 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-15 17:19:44,443 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_28 : int :: (((#memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_28] + 1) || v_ULTIMATE.start_main_~k~0#1_28 < 2) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_28) could not be translated [2023-12-15 17:19:44,445 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-15 17:19:44,445 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~k~0#1_28 : int :: (0 < #memory_int#1[~#a~0!base][4 * v_ULTIMATE.start_main_~k~0#1_28] + 1 || v_ULTIMATE.start_main_~k~0#1_28 < ~k~0 + 1) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_28 + 1) could not be translated [2023-12-15 17:19:44,445 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-15 17:19:44,445 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][~k~0 * 4] could not be translated [2023-12-15 17:19:44,446 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_28 : int :: (((#memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_28] + 1) || v_ULTIMATE.start_main_~k~0#1_28 < 2) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_28) could not be translated [2023-12-15 17:19:44,446 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated [2023-12-15 17:19:44,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 05:19:44 BoogieIcfgContainer [2023-12-15 17:19:44,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 17:19:44,447 INFO L158 Benchmark]: Toolchain (without parser) took 6129.58ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 247.4MB in the beginning and 274.0MB in the end (delta: -26.6MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. [2023-12-15 17:19:44,447 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 17:19:44,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.76ms. Allocated memory is still 297.8MB. Free memory was 247.4MB in the beginning and 236.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 17:19:44,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.93ms. Allocated memory is still 297.8MB. Free memory was 236.5MB in the beginning and 234.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 17:19:44,448 INFO L158 Benchmark]: Boogie Preprocessor took 25.78ms. Allocated memory is still 297.8MB. Free memory was 234.9MB in the beginning and 233.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 17:19:44,448 INFO L158 Benchmark]: RCFGBuilder took 255.49ms. Allocated memory is still 297.8MB. Free memory was 233.2MB in the beginning and 222.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 17:19:44,448 INFO L158 Benchmark]: TraceAbstraction took 5625.67ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 221.2MB in the beginning and 274.0MB in the end (delta: -52.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-15 17:19:44,449 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.11ms. Allocated memory is still 209.7MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.76ms. Allocated memory is still 297.8MB. Free memory was 247.4MB in the beginning and 236.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.93ms. Allocated memory is still 297.8MB. Free memory was 236.5MB in the beginning and 234.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.78ms. Allocated memory is still 297.8MB. Free memory was 234.9MB in the beginning and 233.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.49ms. Allocated memory is still 297.8MB. Free memory was 233.2MB in the beginning and 222.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5625.67ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 221.2MB in the beginning and 274.0MB in the end (delta: -52.8MB). Peak memory consumption was 7.3MB. 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][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_28 : int :: (((#memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_28] + 1) || v_ULTIMATE.start_main_~k~0#1_28 < 2) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_28) 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_~k~0#1_28 : int :: (0 < #memory_int#1[~#a~0!base][4 * v_ULTIMATE.start_main_~k~0#1_28] + 1 || v_ULTIMATE.start_main_~k~0#1_28 < ~k~0 + 1) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_28 + 1) 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][~k~0 * 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_28 : int :: (((#memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int#1[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_28] + 1) || v_ULTIMATE.start_main_~k~0#1_28 < 2) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_28) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#a~0!base][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 5.6s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 48 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 225 HoareAnnotationTreeSize, 2 FormulaSimplifications, 59 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FormulaSimplificationsInter, 285 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 187 ConstructedInterpolants, 8 QuantifiedInterpolants, 1629 SizeOfPredicates, 32 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 5/123 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: 17]: Loop Invariant Derived loop invariant: (((((i == 0) && (100000 <= N)) && (j == 0)) || (((i == 1) && (0 <= j)) && (100000 <= N))) || (2 <= i)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((k == 1) && (2 == i)) || ((k == 1) && (i == 0))) || (2 <= i)) || ((2 <= k) && (2 == i))) || (((k == 1) && (100000 <= N)) && (i <= 1))) RESULT: Ultimate proved your program to be correct! [2023-12-15 17:19:44,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...