/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/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:01:49,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:01:49,173 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 22:01:49,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:01:49,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:01:49,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:01:49,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:01:49,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:01:49,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:01:49,213 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:01:49,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:01:49,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:01:49,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:01:49,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:01:49,215 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:01:49,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:01:49,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:01:49,216 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:01:49,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:01:49,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:01:49,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:01:49,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:01:49,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:01:49,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:01:49,217 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:01:49,217 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:01:49,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:01:49,218 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:01:49,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:01:49,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:01:49,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:01:49,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:01:49,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:01:49,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:01:49,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:01:49,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:01:49,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:01:49,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:01:49,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:01:49,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:01:49,220 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:01:49,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:01:49,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:01:49,221 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 22:01:49,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:01:49,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:01:49,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:01:49,436 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:01:49,437 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:01:49,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2023-12-15 22:01:50,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:01:50,741 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:01:50,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2023-12-15 22:01:50,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080bb282c/1e947ef325c94f4ebfc9e9dbecae7a69/FLAGa5942c765 [2023-12-15 22:01:50,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080bb282c/1e947ef325c94f4ebfc9e9dbecae7a69 [2023-12-15 22:01:50,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:01:50,788 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:01:50,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:01:50,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:01:50,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:01:50,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:01:50" (1/1) ... [2023-12-15 22:01:50,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4102d66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:50, skipping insertion in model container [2023-12-15 22:01:50,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:01:50" (1/1) ... [2023-12-15 22:01:50,836 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:01:50,990 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2023-12-15 22:01:51,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:01:51,029 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:01:51,049 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i[893,906] [2023-12-15 22:01:51,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:01:51,074 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:01:51,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51 WrapperNode [2023-12-15 22:01:51,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:01:51,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:01:51,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:01:51,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:01:51,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,110 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2023-12-15 22:01:51,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:01:51,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:01:51,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:01:51,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:01:51,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 22:01:51,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:01:51,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:01:51,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:01:51,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:01:51,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (1/1) ... [2023-12-15 22:01:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:01:51,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:01:51,203 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 22:01:51,213 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 22:01:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:01:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:01:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:01:51,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:01:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-15 22:01:51,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-15 22:01:51,323 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:01:51,325 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:01:51,482 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:01:51,511 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:01:51,511 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 22:01:51,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:01:51 BoogieIcfgContainer [2023-12-15 22:01:51,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:01:51,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:01:51,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:01:51,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:01:51,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:01:50" (1/3) ... [2023-12-15 22:01:51,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2443c0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:01:51, skipping insertion in model container [2023-12-15 22:01:51,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:01:51" (2/3) ... [2023-12-15 22:01:51,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2443c0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:01:51, skipping insertion in model container [2023-12-15 22:01:51,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:01:51" (3/3) ... [2023-12-15 22:01:51,518 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2023-12-15 22:01:51,529 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:01:51,529 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:01:51,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:01:51,571 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;@482f122b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:01:51,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:01:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 22:01:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 22:01:51,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:51,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:51,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:51,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1062398335, now seen corresponding path program 1 times [2023-12-15 22:01:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125217507] [2023-12-15 22:01:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:51,694 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 22:01:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:51,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125217507] [2023-12-15 22:01:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125217507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:01:51,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:01:51,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 22:01:51,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352218751] [2023-12-15 22:01:51,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:01:51,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 22:01:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 22:01:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 22:01:51,739 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:01:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:51,783 INFO L93 Difference]: Finished difference Result 48 states and 79 transitions. [2023-12-15 22:01:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 22:01:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-15 22:01:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:51,791 INFO L225 Difference]: With dead ends: 48 [2023-12-15 22:01:51,791 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 22:01:51,794 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 22:01:51,797 INFO L413 NwaCegarLoop]: 33 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, 33 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 22:01:51,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:01:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 22:01:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-15 22:01:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 22:01:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-12-15 22:01:51,834 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 9 [2023-12-15 22:01:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:51,834 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-12-15 22:01:51,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:01:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-12-15 22:01:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 22:01:51,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:51,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:51,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:01:51,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:51,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2013109713, now seen corresponding path program 1 times [2023-12-15 22:01:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242212112] [2023-12-15 22:01:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,025 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 22:01:52,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:52,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242212112] [2023-12-15 22:01:52,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242212112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:01:52,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:01:52,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:01:52,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46926463] [2023-12-15 22:01:52,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:01:52,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:01:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:52,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:01:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:01:52,033 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:01:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:52,102 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2023-12-15 22:01:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 22:01:52,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-15 22:01:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:52,103 INFO L225 Difference]: With dead ends: 29 [2023-12-15 22:01:52,104 INFO L226 Difference]: Without dead ends: 27 [2023-12-15 22:01:52,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:01:52,105 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:52,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 64 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:01:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-15 22:01:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-15 22:01:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 22:01:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-12-15 22:01:52,121 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2023-12-15 22:01:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:52,121 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-12-15 22:01:52,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:01:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-12-15 22:01:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 22:01:52,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:52,123 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:52,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:01:52,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:52,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash -908723572, now seen corresponding path program 1 times [2023-12-15 22:01:52,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:52,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812493332] [2023-12-15 22:01:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:52,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-15 22:01:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:01:52,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:52,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812493332] [2023-12-15 22:01:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812493332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:01:52,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:01:52,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:01:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469694292] [2023-12-15 22:01:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:01:52,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:01:52,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:52,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:01:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:01:52,283 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 22:01:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:52,380 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2023-12-15 22:01:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:01:52,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-15 22:01:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:52,383 INFO L225 Difference]: With dead ends: 42 [2023-12-15 22:01:52,383 INFO L226 Difference]: Without dead ends: 40 [2023-12-15 22:01:52,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 22:01:52,385 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:52,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:01:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-15 22:01:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2023-12-15 22:01:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 22:01:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2023-12-15 22:01:52,404 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 15 [2023-12-15 22:01:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:52,404 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2023-12-15 22:01:52,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 22:01:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2023-12-15 22:01:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 22:01:52,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:52,405 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:52,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 22:01:52,405 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:52,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:52,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2036104194, now seen corresponding path program 1 times [2023-12-15 22:01:52,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:52,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854396658] [2023-12-15 22:01:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:01:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:01:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 22:01:52,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854396658] [2023-12-15 22:01:52,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854396658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:01:52,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:01:52,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:01:52,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280885133] [2023-12-15 22:01:52,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:01:52,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:01:52,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:01:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:01:52,535 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:01:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:52,611 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2023-12-15 22:01:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:01:52,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-15 22:01:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:52,612 INFO L225 Difference]: With dead ends: 48 [2023-12-15 22:01:52,612 INFO L226 Difference]: Without dead ends: 46 [2023-12-15 22:01:52,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:01:52,613 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:52,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 170 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:01:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-15 22:01:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-12-15 22:01:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 22:01:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-12-15 22:01:52,620 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2023-12-15 22:01:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:52,620 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-12-15 22:01:52,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:01:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-12-15 22:01:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 22:01:52,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:52,622 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:52,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 22:01:52,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:52,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2030546205, now seen corresponding path program 1 times [2023-12-15 22:01:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671890630] [2023-12-15 22:01:52,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:52,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-15 22:01:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:01:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 22:01:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:01:52,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:52,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671890630] [2023-12-15 22:01:52,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671890630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:01:52,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:01:52,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:01:52,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952776153] [2023-12-15 22:01:52,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:01:52,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:01:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:52,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:01:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:01:52,690 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:01:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:52,819 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2023-12-15 22:01:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:01:52,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-12-15 22:01:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:52,822 INFO L225 Difference]: With dead ends: 67 [2023-12-15 22:01:52,822 INFO L226 Difference]: Without dead ends: 60 [2023-12-15 22:01:52,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:01:52,834 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:52,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 77 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:01:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-15 22:01:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2023-12-15 22:01:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 22:01:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2023-12-15 22:01:52,855 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 26 [2023-12-15 22:01:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:52,855 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-12-15 22:01:52,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:01:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2023-12-15 22:01:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 22:01:52,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:52,856 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:52,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 22:01:52,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:52,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1313350375, now seen corresponding path program 1 times [2023-12-15 22:01:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:52,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278685359] [2023-12-15 22:01:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:01:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:01:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:01:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:01:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278685359] [2023-12-15 22:01:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278685359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:01:53,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:01:53,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:01:53,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172871181] [2023-12-15 22:01:53,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:01:53,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:01:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:53,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:01:53,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:01:53,012 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:01:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:53,084 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2023-12-15 22:01:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:01:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-12-15 22:01:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:53,085 INFO L225 Difference]: With dead ends: 68 [2023-12-15 22:01:53,085 INFO L226 Difference]: Without dead ends: 66 [2023-12-15 22:01:53,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:01:53,088 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:53,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 132 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:01:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-15 22:01:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2023-12-15 22:01:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 22:01:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2023-12-15 22:01:53,103 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 27 [2023-12-15 22:01:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:53,103 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-12-15 22:01:53,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:01:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2023-12-15 22:01:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-15 22:01:53,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:53,104 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:53,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 22:01:53,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:53,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1160009689, now seen corresponding path program 1 times [2023-12-15 22:01:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:53,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440476171] [2023-12-15 22:01:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:01:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:01:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:01:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:01:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 22:01:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:01:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 22:01:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 22:01:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440476171] [2023-12-15 22:01:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440476171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:01:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024955744] [2023-12-15 22:01:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:01:53,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:01:53,223 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 22:01:53,255 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 22:01:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:53,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-15 22:01:53,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:01:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-15 22:01:53,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:01:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-15 22:01:53,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024955744] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:01:53,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:01:53,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2023-12-15 22:01:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664324925] [2023-12-15 22:01:53,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:01:53,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-15 22:01:53,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-15 22:01:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-12-15 22:01:53,671 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 19 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2023-12-15 22:01:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:53,944 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2023-12-15 22:01:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-15 22:01:53,945 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 50 [2023-12-15 22:01:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:53,946 INFO L225 Difference]: With dead ends: 102 [2023-12-15 22:01:53,947 INFO L226 Difference]: Without dead ends: 87 [2023-12-15 22:01:53,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2023-12-15 22:01:53,948 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:53,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 150 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:01:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-15 22:01:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-12-15 22:01:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 52 states have internal predecessors, (54), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-15 22:01:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2023-12-15 22:01:53,956 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 50 [2023-12-15 22:01:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:53,957 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2023-12-15 22:01:53,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2023-12-15 22:01:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2023-12-15 22:01:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-15 22:01:53,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:53,958 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:53,965 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 22:01:54,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:01:54,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:54,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1190365469, now seen corresponding path program 1 times [2023-12-15 22:01:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:54,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574708196] [2023-12-15 22:01:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:01:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:01:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:01:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:01:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:01:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:01:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 22:01:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 22:01:54,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574708196] [2023-12-15 22:01:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574708196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:01:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74997685] [2023-12-15 22:01:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:01:54,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:01:54,289 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 22:01:54,310 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 22:01:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-15 22:01:54,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:01:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 22:01:54,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:01:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 22:01:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74997685] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:01:54,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:01:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-12-15 22:01:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110746635] [2023-12-15 22:01:54,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:01:54,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 22:01:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:54,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 22:01:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-15 22:01:54,495 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2023-12-15 22:01:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:54,587 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2023-12-15 22:01:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:01:54,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 51 [2023-12-15 22:01:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:54,590 INFO L225 Difference]: With dead ends: 88 [2023-12-15 22:01:54,590 INFO L226 Difference]: Without dead ends: 86 [2023-12-15 22:01:54,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-12-15 22:01:54,591 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:54,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 193 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:01:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-15 22:01:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-15 22:01:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 55 states have internal predecessors, (57), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-15 22:01:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2023-12-15 22:01:54,609 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 51 [2023-12-15 22:01:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:54,609 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2023-12-15 22:01:54,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2023-12-15 22:01:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2023-12-15 22:01:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-15 22:01:54,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:54,610 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:54,617 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 22:01:54,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-15 22:01:54,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:54,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash 813879981, now seen corresponding path program 2 times [2023-12-15 22:01:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655613926] [2023-12-15 22:01:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:01:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:01:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:01:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:01:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:01:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:01:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 22:01:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 22:01:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:01:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 22:01:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:01:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-15 22:01:54,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655613926] [2023-12-15 22:01:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655613926] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:01:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074306531] [2023-12-15 22:01:54,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 22:01:54,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:01:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:01:54,968 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 22:01:54,993 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 22:01:55,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 22:01:55,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 22:01:55,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 22:01:55,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:01:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 21 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-15 22:01:55,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:01:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 21 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-15 22:01:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074306531] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:01:55,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:01:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 24 [2023-12-15 22:01:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712512692] [2023-12-15 22:01:55,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:01:55,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-15 22:01:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:55,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-15 22:01:55,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2023-12-15 22:01:55,383 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 24 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 13 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 13 states have call successors, (32) [2023-12-15 22:01:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:55,782 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-12-15 22:01:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-15 22:01:55,782 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 13 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 13 states have call successors, (32) Word has length 75 [2023-12-15 22:01:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:55,785 INFO L225 Difference]: With dead ends: 102 [2023-12-15 22:01:55,785 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 22:01:55,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2023-12-15 22:01:55,786 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 68 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:55,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 233 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 22:01:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 22:01:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2023-12-15 22:01:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 58 states have internal predecessors, (60), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-15 22:01:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2023-12-15 22:01:55,798 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 75 [2023-12-15 22:01:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:55,798 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2023-12-15 22:01:55,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 13 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 13 states have call successors, (32) [2023-12-15 22:01:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2023-12-15 22:01:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 22:01:55,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:01:55,799 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:55,806 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 22:01:56,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:01:56,004 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:01:56,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:01:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash -239313979, now seen corresponding path program 2 times [2023-12-15 22:01:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:01:56,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275078886] [2023-12-15 22:01:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:01:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:01:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:01:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:01:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:01:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:01:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:01:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:01:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 22:01:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 22:01:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:01:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 22:01:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:01:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:01:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 22:01:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:01:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:01:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:01:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 56 proven. 46 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 22:01:56,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:01:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275078886] [2023-12-15 22:01:56,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275078886] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:01:56,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136855205] [2023-12-15 22:01:56,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 22:01:56,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:01:56,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:01:56,362 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 22:01:56,403 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 22:01:56,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 22:01:56,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 22:01:56,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-15 22:01:56,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:01:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 64 proven. 67 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2023-12-15 22:01:56,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:01:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 71 proven. 60 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2023-12-15 22:01:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136855205] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:01:56,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:01:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 20 [2023-12-15 22:01:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499080417] [2023-12-15 22:01:56,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:01:56,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-15 22:01:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:01:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-15 22:01:56,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2023-12-15 22:01:56,747 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2023-12-15 22:01:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:01:57,105 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2023-12-15 22:01:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 22:01:57,105 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) Word has length 98 [2023-12-15 22:01:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:01:57,107 INFO L225 Difference]: With dead ends: 90 [2023-12-15 22:01:57,107 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 22:01:57,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2023-12-15 22:01:57,108 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:01:57,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 247 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 22:01:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 22:01:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 22:01:57,109 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 22:01:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 22:01:57,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2023-12-15 22:01:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:01:57,109 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 22:01:57,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2023-12-15 22:01:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 22:01:57,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 22:01:57,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:01:57,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-15 22:01:57,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:01:57,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 22:01:58,058 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2023-12-15 22:01:58,058 INFO L899 garLoopResultBuilder]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2023-12-15 22:01:58,059 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and (<= 1 |ULTIMATE.start_main_~in~0#1|) .cse0) (and .cse0 (= |ULTIMATE.start_main_~in~0#1| 0)))) (<= (+ |ULTIMATE.start_main_~buf~0#1| 1) |ULTIMATE.start_main_~bufferlen~0#1|)) [2023-12-15 22:01:58,059 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and (<= 1 |ULTIMATE.start_main_~in~0#1|) .cse0) (and .cse0 (= |ULTIMATE.start_main_~in~0#1| 0)))) (<= (+ |ULTIMATE.start_main_~buf~0#1| 1) |ULTIMATE.start_main_~bufferlen~0#1|)) [2023-12-15 22:01:58,059 INFO L899 garLoopResultBuilder]: For program point L32(lines 25 56) no Hoare annotation was computed. [2023-12-15 22:01:58,059 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-15 22:01:58,061 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and .cse0 (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|) (<= |ULTIMATE.start_main_~buf~0#1| 2) .cse1 (<= 3 |ULTIMATE.start_main_~bufferlen~0#1|)) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (= |ULTIMATE.start_main_~bufferlen~0#1| (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) .cse0 (<= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|) .cse1) (and (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|) (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~in~0#1| 0)))) [2023-12-15 22:01:58,061 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~bufferlen~0#1| (+ 2 |ULTIMATE.start_main_~buflim~0#1|)))) (or (and (= |ULTIMATE.start_main_~buf~0#1| 0) .cse0 (<= (+ 3 |ULTIMATE.start_main_~buflim~0#1|) |ULTIMATE.start_main_~inlen~0#1|) (= |ULTIMATE.start_main_~in~0#1| 0) (<= 3 |ULTIMATE.start_main_~bufferlen~0#1|)) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) .cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|) (not (= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|))))) [2023-12-15 22:01:58,061 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~bufferlen~0#1| (+ 2 |ULTIMATE.start_main_~buflim~0#1|)))) (or (and (= |ULTIMATE.start_main_~buf~0#1| 0) .cse0 (<= (+ 3 |ULTIMATE.start_main_~buflim~0#1|) |ULTIMATE.start_main_~inlen~0#1|) (= |ULTIMATE.start_main_~in~0#1| 0) (<= 3 |ULTIMATE.start_main_~bufferlen~0#1|)) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) .cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|) (not (= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|))))) [2023-12-15 22:01:58,061 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2023-12-15 22:01:58,061 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and .cse0 (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|) (<= |ULTIMATE.start_main_~buf~0#1| 2) .cse1 (<= 3 |ULTIMATE.start_main_~bufferlen~0#1|)) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (= |ULTIMATE.start_main_~bufferlen~0#1| (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) .cse0 (<= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|) .cse1) (and (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|) (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~in~0#1| 0)))) [2023-12-15 22:01:58,061 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 22:01:58,061 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-15 22:01:58,061 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (= |ULTIMATE.start_main_~bufferlen~0#1| (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|)) [2023-12-15 22:01:58,061 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (= |ULTIMATE.start_main_~bufferlen~0#1| (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|)) [2023-12-15 22:01:58,061 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2023-12-15 22:01:58,061 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 22:01:58,061 INFO L899 garLoopResultBuilder]: For program point L55(lines 25 56) no Hoare annotation was computed. [2023-12-15 22:01:58,062 INFO L895 garLoopResultBuilder]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~bufferlen~0#1| (+ 2 |ULTIMATE.start_main_~buflim~0#1|)))) (or (and (= |ULTIMATE.start_main_~buf~0#1| 0) .cse0 (<= 0 |ULTIMATE.start_main_~buflim~0#1|) (<= (+ 3 |ULTIMATE.start_main_~buflim~0#1|) |ULTIMATE.start_main_~inlen~0#1|) (= |ULTIMATE.start_main_~in~0#1| 0)) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) .cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~buflim~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|)))) [2023-12-15 22:01:58,062 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2023-12-15 22:01:58,062 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-12-15 22:01:58,062 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-12-15 22:01:58,062 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-12-15 22:01:58,062 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 22:01:58,062 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 22:01:58,062 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-12-15 22:01:58,064 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-12-15 22:01:58,066 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:01:58,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:01:58 BoogieIcfgContainer [2023-12-15 22:01:58,086 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:01:58,087 INFO L158 Benchmark]: Toolchain (without parser) took 7298.88ms. Allocated memory was 194.0MB in the beginning and 293.6MB in the end (delta: 99.6MB). Free memory was 157.9MB in the beginning and 114.9MB in the end (delta: 42.9MB). Peak memory consumption was 144.1MB. Max. memory is 8.0GB. [2023-12-15 22:01:58,087 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:01:58,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.46ms. Allocated memory is still 194.0MB. Free memory was 157.9MB in the beginning and 146.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 22:01:58,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.82ms. Allocated memory is still 194.0MB. Free memory was 146.8MB in the beginning and 145.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 22:01:58,087 INFO L158 Benchmark]: Boogie Preprocessor took 44.01ms. Allocated memory is still 194.0MB. Free memory was 145.3MB in the beginning and 143.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:01:58,088 INFO L158 Benchmark]: RCFGBuilder took 355.71ms. Allocated memory is still 194.0MB. Free memory was 143.2MB in the beginning and 131.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 22:01:58,088 INFO L158 Benchmark]: TraceAbstraction took 6572.71ms. Allocated memory was 194.0MB in the beginning and 293.6MB in the end (delta: 99.6MB). Free memory was 130.6MB in the beginning and 114.9MB in the end (delta: 15.7MB). Peak memory consumption was 116.8MB. Max. memory is 8.0GB. [2023-12-15 22:01:58,090 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.10ms. Allocated memory is still 194.0MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 286.46ms. Allocated memory is still 194.0MB. Free memory was 157.9MB in the beginning and 146.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.82ms. Allocated memory is still 194.0MB. Free memory was 146.8MB in the beginning and 145.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.01ms. Allocated memory is still 194.0MB. Free memory was 145.3MB in the beginning and 143.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 355.71ms. Allocated memory is still 194.0MB. Free memory was 143.2MB in the beginning and 131.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6572.71ms. Allocated memory was 194.0MB in the beginning and 293.6MB in the end (delta: 99.6MB). Free memory was 130.6MB in the beginning and 114.9MB in the end (delta: 15.7MB). Peak memory consumption was 116.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 1388 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1132 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1018 IncrementalHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 256 mSDtfsCounter, 1018 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 757 GetRequests, 606 SyntacticMatches, 15 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=9, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 55 PreInvPairs, 98 NumberOfFragments, 339 HoareAnnotationTreeSize, 55 FormulaSimplifications, 946 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FormulaSimplificationsInter, 1434 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 2965 SizeOfPredicates, 23 NumberOfNonLiveVariables, 618 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2523/2902 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: 37]: Loop Invariant Derived loop invariant: ((((((buf == 0) && (bufferlen == (2 + buflim))) && (0 <= buflim)) && ((3 + buflim) <= inlen)) && (in == 0)) || (((((((bufferlen + in) + 1) <= (buf + inlen)) && (bufferlen == (2 + buflim))) && (1 <= in)) && (buf <= buflim)) && (0 <= buf))) RESULT: Ultimate proved your program to be correct! [2023-12-15 22:01:58,115 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...