/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/locks/test_locks_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 18:10:46,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 18:10:46,862 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 18:10:46,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 18:10:46,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 18:10:46,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 18:10:46,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 18:10:46,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 18:10:46,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 18:10:46,891 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 18:10:46,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 18:10:46,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 18:10:46,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 18:10:46,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 18:10:46,894 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 18:10:46,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 18:10:46,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 18:10:46,894 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 18:10:46,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 18:10:46,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 18:10:46,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 18:10:46,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 18:10:46,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 18:10:46,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 18:10:46,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 18:10:46,896 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 18:10:46,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 18:10:46,896 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 18:10:46,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 18:10:46,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 18:10:46,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 18:10:46,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 18:10:46,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 18:10:46,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 18:10:46,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 18:10:46,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 18:10:46,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 18:10:46,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 18:10:46,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 18:10:46,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 18:10:46,899 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 18:10:46,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 18:10:46,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 18:10:46,899 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 18:10:47,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 18:10:47,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 18:10:47,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 18:10:47,126 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 18:10:47,126 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 18:10:47,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2023-12-15 18:10:48,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 18:10:48,339 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 18:10:48,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2023-12-15 18:10:48,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8acb914/7f743d05d0c649f8abec57f5c7341ddf/FLAG941001748 [2023-12-15 18:10:48,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8acb914/7f743d05d0c649f8abec57f5c7341ddf [2023-12-15 18:10:48,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 18:10:48,368 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 18:10:48,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 18:10:48,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 18:10:48,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 18:10:48,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eaa8f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48, skipping insertion in model container [2023-12-15 18:10:48,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,402 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 18:10:48,535 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c[4936,4949] [2023-12-15 18:10:48,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 18:10:48,551 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 18:10:48,571 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c[4936,4949] [2023-12-15 18:10:48,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 18:10:48,581 INFO L206 MainTranslator]: Completed translation [2023-12-15 18:10:48,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48 WrapperNode [2023-12-15 18:10:48,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 18:10:48,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 18:10:48,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 18:10:48,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 18:10:48,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,605 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2023-12-15 18:10:48,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 18:10:48,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 18:10:48,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 18:10:48,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 18:10:48,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,621 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 18:10:48,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 18:10:48,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 18:10:48,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 18:10:48,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 18:10:48,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (1/1) ... [2023-12-15 18:10:48,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 18:10:48,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:10:48,688 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 18:10:48,777 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 18:10:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 18:10:48,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 18:10:48,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 18:10:48,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 18:10:48,855 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 18:10:48,857 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 18:10:49,093 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 18:10:49,118 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 18:10:49,118 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 18:10:49,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 06:10:49 BoogieIcfgContainer [2023-12-15 18:10:49,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 18:10:49,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 18:10:49,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 18:10:49,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 18:10:49,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 06:10:48" (1/3) ... [2023-12-15 18:10:49,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0f05af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 06:10:49, skipping insertion in model container [2023-12-15 18:10:49,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:10:48" (2/3) ... [2023-12-15 18:10:49,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0f05af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 06:10:49, skipping insertion in model container [2023-12-15 18:10:49,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 06:10:49" (3/3) ... [2023-12-15 18:10:49,125 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2023-12-15 18:10:49,137 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 18:10:49,137 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 18:10:49,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 18:10:49,178 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;@53259d25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 18:10:49,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 18:10:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 46 states have internal predecessors, (88), 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 18:10:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 18:10:49,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,200 INFO L85 PathProgramCache]: Analyzing trace with hash -111224238, now seen corresponding path program 1 times [2023-12-15 18:10:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715137293] [2023-12-15 18:10:49,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,367 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 18:10:49,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715137293] [2023-12-15 18:10:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715137293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001661507] [2023-12-15 18:10:49,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,415 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 46 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,479 INFO L93 Difference]: Finished difference Result 96 states and 177 transitions. [2023-12-15 18:10:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-15 18:10:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,490 INFO L225 Difference]: With dead ends: 96 [2023-12-15 18:10:49,490 INFO L226 Difference]: Without dead ends: 86 [2023-12-15 18:10:49,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,495 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 65 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-15 18:10:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2023-12-15 18:10:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.912280701754386) internal successors, (109), 57 states have internal predecessors, (109), 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 18:10:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2023-12-15 18:10:49,528 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2023-12-15 18:10:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,529 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2023-12-15 18:10:49,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2023-12-15 18:10:49,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 18:10:49,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 18:10:49,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1132292592, now seen corresponding path program 1 times [2023-12-15 18:10:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000668303] [2023-12-15 18:10:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,644 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 18:10:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000668303] [2023-12-15 18:10:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000668303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521175207] [2023-12-15 18:10:49,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,652 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,679 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2023-12-15 18:10:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-15 18:10:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,683 INFO L225 Difference]: With dead ends: 143 [2023-12-15 18:10:49,683 INFO L226 Difference]: Without dead ends: 86 [2023-12-15 18:10:49,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,685 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-15 18:10:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2023-12-15 18:10:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.891566265060241) internal successors, (157), 83 states have internal predecessors, (157), 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 18:10:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2023-12-15 18:10:49,697 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2023-12-15 18:10:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,697 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2023-12-15 18:10:49,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2023-12-15 18:10:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 18:10:49,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 18:10:49,698 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash 847228294, now seen corresponding path program 1 times [2023-12-15 18:10:49,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925126565] [2023-12-15 18:10:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,756 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 18:10:49,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925126565] [2023-12-15 18:10:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925126565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961917737] [2023-12-15 18:10:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,758 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,771 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2023-12-15 18:10:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-15 18:10:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,772 INFO L225 Difference]: With dead ends: 131 [2023-12-15 18:10:49,772 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 18:10:49,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,773 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 65 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 18:10:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2023-12-15 18:10:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.8488372093023255) internal successors, (159), 86 states have internal predecessors, (159), 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 18:10:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2023-12-15 18:10:49,778 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2023-12-15 18:10:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,779 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2023-12-15 18:10:49,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2023-12-15 18:10:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 18:10:49,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 18:10:49,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -741119608, now seen corresponding path program 1 times [2023-12-15 18:10:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994917401] [2023-12-15 18:10:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,813 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 18:10:49,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994917401] [2023-12-15 18:10:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994917401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845312715] [2023-12-15 18:10:49,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,815 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,839 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2023-12-15 18:10:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-15 18:10:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,840 INFO L225 Difference]: With dead ends: 168 [2023-12-15 18:10:49,840 INFO L226 Difference]: Without dead ends: 166 [2023-12-15 18:10:49,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,841 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 60 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-15 18:10:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2023-12-15 18:10:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.8434782608695652) internal successors, (212), 115 states have internal predecessors, (212), 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 18:10:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2023-12-15 18:10:49,848 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2023-12-15 18:10:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,849 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2023-12-15 18:10:49,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2023-12-15 18:10:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 18:10:49,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 18:10:49,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1762187962, now seen corresponding path program 1 times [2023-12-15 18:10:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733637902] [2023-12-15 18:10:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,899 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 18:10:49,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733637902] [2023-12-15 18:10:49,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733637902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192991925] [2023-12-15 18:10:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,901 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,912 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2023-12-15 18:10:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-15 18:10:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,913 INFO L225 Difference]: With dead ends: 280 [2023-12-15 18:10:49,913 INFO L226 Difference]: Without dead ends: 168 [2023-12-15 18:10:49,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,914 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 62 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 183 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-15 18:10:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2023-12-15 18:10:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.8303030303030303) internal successors, (302), 165 states have internal predecessors, (302), 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 18:10:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2023-12-15 18:10:49,920 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2023-12-15 18:10:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,921 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2023-12-15 18:10:49,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2023-12-15 18:10:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-15 18:10:49,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 18:10:49,922 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1499658651, now seen corresponding path program 1 times [2023-12-15 18:10:49,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996076288] [2023-12-15 18:10:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:49,943 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 18:10:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996076288] [2023-12-15 18:10:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996076288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:49,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:49,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:49,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856359838] [2023-12-15 18:10:49,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:49,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:49,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:49,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,945 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:49,959 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2023-12-15 18:10:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-15 18:10:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:49,961 INFO L225 Difference]: With dead ends: 251 [2023-12-15 18:10:49,961 INFO L226 Difference]: Without dead ends: 170 [2023-12-15 18:10:49,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:49,962 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:49,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-15 18:10:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2023-12-15 18:10:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.8083832335329342) internal successors, (302), 167 states have internal predecessors, (302), 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 18:10:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2023-12-15 18:10:49,968 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2023-12-15 18:10:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:49,968 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2023-12-15 18:10:49,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2023-12-15 18:10:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-15 18:10:49,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:49,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:49,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 18:10:49,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:49,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:49,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1206960743, now seen corresponding path program 1 times [2023-12-15 18:10:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:49,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169046428] [2023-12-15 18:10:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,012 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 18:10:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169046428] [2023-12-15 18:10:50,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169046428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859353659] [2023-12-15 18:10:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,013 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,030 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2023-12-15 18:10:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-15 18:10:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,032 INFO L225 Difference]: With dead ends: 488 [2023-12-15 18:10:50,032 INFO L226 Difference]: Without dead ends: 326 [2023-12-15 18:10:50,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,035 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 62 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 160 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-12-15 18:10:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2023-12-15 18:10:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.7894736842105263) internal successors, (578), 323 states have internal predecessors, (578), 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 18:10:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2023-12-15 18:10:50,053 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2023-12-15 18:10:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,054 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2023-12-15 18:10:50,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2023-12-15 18:10:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-15 18:10:50,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:10:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 18:10:50,059 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2066938199, now seen corresponding path program 1 times [2023-12-15 18:10:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071703173] [2023-12-15 18:10:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,099 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 18:10:50,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071703173] [2023-12-15 18:10:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071703173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181388589] [2023-12-15 18:10:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,102 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,115 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2023-12-15 18:10:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-15 18:10:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,117 INFO L225 Difference]: With dead ends: 416 [2023-12-15 18:10:50,118 INFO L226 Difference]: Without dead ends: 414 [2023-12-15 18:10:50,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,120 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2023-12-15 18:10:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2023-12-15 18:10:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.7770897832817338) internal successors, (574), 323 states have internal predecessors, (574), 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 18:10:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2023-12-15 18:10:50,141 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2023-12-15 18:10:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,141 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2023-12-15 18:10:50,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2023-12-15 18:10:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 18:10:50,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,142 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 18:10:50,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1238709573, now seen corresponding path program 1 times [2023-12-15 18:10:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458055653] [2023-12-15 18:10:50,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,166 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 18:10:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458055653] [2023-12-15 18:10:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458055653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579860378] [2023-12-15 18:10:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,167 INFO L87 Difference]: Start difference. First operand 324 states and 574 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,182 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2023-12-15 18:10:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-15 18:10:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,185 INFO L225 Difference]: With dead ends: 612 [2023-12-15 18:10:50,185 INFO L226 Difference]: Without dead ends: 610 [2023-12-15 18:10:50,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,189 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 54 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2023-12-15 18:10:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2023-12-15 18:10:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.749440715883669) internal successors, (782), 447 states have internal predecessors, (782), 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 18:10:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2023-12-15 18:10:50,202 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2023-12-15 18:10:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,202 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2023-12-15 18:10:50,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2023-12-15 18:10:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 18:10:50,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,205 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 18:10:50,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2035189369, now seen corresponding path program 1 times [2023-12-15 18:10:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058906548] [2023-12-15 18:10:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,240 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 18:10:50,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058906548] [2023-12-15 18:10:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058906548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536756208] [2023-12-15 18:10:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,241 INFO L87 Difference]: Start difference. First operand 448 states and 782 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,259 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2023-12-15 18:10:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-15 18:10:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,262 INFO L225 Difference]: With dead ends: 1076 [2023-12-15 18:10:50,262 INFO L226 Difference]: Without dead ends: 634 [2023-12-15 18:10:50,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,263 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-12-15 18:10:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2023-12-15 18:10:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.740095087163233) internal successors, (1098), 631 states have internal predecessors, (1098), 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 18:10:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2023-12-15 18:10:50,276 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2023-12-15 18:10:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,277 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2023-12-15 18:10:50,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2023-12-15 18:10:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 18:10:50,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,279 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 18:10:50,279 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash 254922300, now seen corresponding path program 1 times [2023-12-15 18:10:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071635053] [2023-12-15 18:10:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,302 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 18:10:50,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071635053] [2023-12-15 18:10:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071635053] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887763520] [2023-12-15 18:10:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,304 INFO L87 Difference]: Start difference. First operand 632 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,317 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2023-12-15 18:10:50,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-15 18:10:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,320 INFO L225 Difference]: With dead ends: 956 [2023-12-15 18:10:50,320 INFO L226 Difference]: Without dead ends: 646 [2023-12-15 18:10:50,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,321 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 62 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2023-12-15 18:10:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2023-12-15 18:10:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.7200622083981338) internal successors, (1106), 643 states have internal predecessors, (1106), 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 18:10:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2023-12-15 18:10:50,333 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2023-12-15 18:10:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,333 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2023-12-15 18:10:50,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2023-12-15 18:10:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 18:10:50,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,334 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 18:10:50,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1333425602, now seen corresponding path program 1 times [2023-12-15 18:10:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121952686] [2023-12-15 18:10:50,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,362 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 18:10:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121952686] [2023-12-15 18:10:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121952686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596745969] [2023-12-15 18:10:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,363 INFO L87 Difference]: Start difference. First operand 644 states and 1106 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,380 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2023-12-15 18:10:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-15 18:10:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,386 INFO L225 Difference]: With dead ends: 1192 [2023-12-15 18:10:50,386 INFO L226 Difference]: Without dead ends: 1190 [2023-12-15 18:10:50,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,388 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 51 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2023-12-15 18:10:50,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2023-12-15 18:10:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.6840934371523915) internal successors, (1514), 899 states have internal predecessors, (1514), 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 18:10:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2023-12-15 18:10:50,406 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2023-12-15 18:10:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,406 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2023-12-15 18:10:50,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2023-12-15 18:10:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 18:10:50,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,407 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 18:10:50,407 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1940473340, now seen corresponding path program 1 times [2023-12-15 18:10:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661452837] [2023-12-15 18:10:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,436 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 18:10:50,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661452837] [2023-12-15 18:10:50,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661452837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048838913] [2023-12-15 18:10:50,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,438 INFO L87 Difference]: Start difference. First operand 900 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,470 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2023-12-15 18:10:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-15 18:10:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,474 INFO L225 Difference]: With dead ends: 2136 [2023-12-15 18:10:50,474 INFO L226 Difference]: Without dead ends: 1254 [2023-12-15 18:10:50,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,476 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 186 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2023-12-15 18:10:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2023-12-15 18:10:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.6770583533173462) internal successors, (2098), 1251 states have internal predecessors, (2098), 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 18:10:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2023-12-15 18:10:50,514 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2023-12-15 18:10:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,514 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2023-12-15 18:10:50,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2023-12-15 18:10:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 18:10:50,515 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,515 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 18:10:50,515 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1613693038, now seen corresponding path program 1 times [2023-12-15 18:10:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435271660] [2023-12-15 18:10:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,535 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 18:10:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435271660] [2023-12-15 18:10:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435271660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149062765] [2023-12-15 18:10:50,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,537 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,559 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2023-12-15 18:10:50,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-15 18:10:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,562 INFO L225 Difference]: With dead ends: 1880 [2023-12-15 18:10:50,562 INFO L226 Difference]: Without dead ends: 1270 [2023-12-15 18:10:50,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,564 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2023-12-15 18:10:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2023-12-15 18:10:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 1.6558800315706392) internal successors, (2098), 1267 states have internal predecessors, (2098), 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 18:10:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2023-12-15 18:10:50,614 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2023-12-15 18:10:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,615 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2023-12-15 18:10:50,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2023-12-15 18:10:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 18:10:50,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,616 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 18:10:50,616 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash 25345136, now seen corresponding path program 1 times [2023-12-15 18:10:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015757715] [2023-12-15 18:10:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,640 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 18:10:50,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015757715] [2023-12-15 18:10:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015757715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302491345] [2023-12-15 18:10:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,642 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,684 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2023-12-15 18:10:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-15 18:10:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,691 INFO L225 Difference]: With dead ends: 2312 [2023-12-15 18:10:50,691 INFO L226 Difference]: Without dead ends: 2310 [2023-12-15 18:10:50,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,692 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2023-12-15 18:10:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2023-12-15 18:10:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1795 states have (on average 1.6144846796657382) internal successors, (2898), 1795 states have internal predecessors, (2898), 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 18:10:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2023-12-15 18:10:50,728 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2023-12-15 18:10:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,728 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2023-12-15 18:10:50,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2023-12-15 18:10:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 18:10:50,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,730 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 18:10:50,730 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash -995723218, now seen corresponding path program 1 times [2023-12-15 18:10:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109124290] [2023-12-15 18:10:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,748 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 18:10:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109124290] [2023-12-15 18:10:50,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109124290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888554597] [2023-12-15 18:10:50,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,751 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,785 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2023-12-15 18:10:50,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-15 18:10:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,791 INFO L225 Difference]: With dead ends: 4232 [2023-12-15 18:10:50,791 INFO L226 Difference]: Without dead ends: 2470 [2023-12-15 18:10:50,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,796 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 187 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2023-12-15 18:10:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2023-12-15 18:10:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2467 states have (on average 1.6092419943250913) internal successors, (3970), 2467 states have internal predecessors, (3970), 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 18:10:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2023-12-15 18:10:50,850 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2023-12-15 18:10:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:50,850 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2023-12-15 18:10:50,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2023-12-15 18:10:50,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 18:10:50,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:50,852 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:50,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 18:10:50,852 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:50,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 785913297, now seen corresponding path program 1 times [2023-12-15 18:10:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:50,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688812905] [2023-12-15 18:10:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:50,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:50,867 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 18:10:50,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688812905] [2023-12-15 18:10:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688812905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:50,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944719879] [2023-12-15 18:10:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:50,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:50,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:50,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:50,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,869 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:50,899 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2023-12-15 18:10:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:50,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-15 18:10:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:50,906 INFO L225 Difference]: With dead ends: 3704 [2023-12-15 18:10:50,906 INFO L226 Difference]: Without dead ends: 2502 [2023-12-15 18:10:50,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:50,908 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:50,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2023-12-15 18:10:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2023-12-15 18:10:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2499 states have (on average 1.5886354541816727) internal successors, (3970), 2499 states have internal predecessors, (3970), 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 18:10:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2023-12-15 18:10:51,009 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2023-12-15 18:10:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:51,009 INFO L495 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2023-12-15 18:10:51,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2023-12-15 18:10:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 18:10:51,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:51,011 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:51,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 18:10:51,011 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:51,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash -802434605, now seen corresponding path program 1 times [2023-12-15 18:10:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:51,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604563455] [2023-12-15 18:10:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:51,032 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 18:10:51,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604563455] [2023-12-15 18:10:51,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604563455] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:51,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:51,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:51,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232237335] [2023-12-15 18:10:51,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:51,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:51,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:51,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,034 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:51,079 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2023-12-15 18:10:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:51,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-15 18:10:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:51,091 INFO L225 Difference]: With dead ends: 4488 [2023-12-15 18:10:51,092 INFO L226 Difference]: Without dead ends: 4486 [2023-12-15 18:10:51,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,093 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:51,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2023-12-15 18:10:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2023-12-15 18:10:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 3587 states have (on average 1.5439085586841372) internal successors, (5538), 3587 states have internal predecessors, (5538), 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 18:10:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2023-12-15 18:10:51,172 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2023-12-15 18:10:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:51,172 INFO L495 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2023-12-15 18:10:51,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2023-12-15 18:10:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 18:10:51,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:51,174 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:51,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 18:10:51,175 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:51,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1823502959, now seen corresponding path program 1 times [2023-12-15 18:10:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629604901] [2023-12-15 18:10:51,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:51,196 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 18:10:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:51,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629604901] [2023-12-15 18:10:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629604901] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:51,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:51,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:51,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818280858] [2023-12-15 18:10:51,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:51,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:51,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:51,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,198 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:51,262 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2023-12-15 18:10:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:51,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-15 18:10:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:51,288 INFO L225 Difference]: With dead ends: 8392 [2023-12-15 18:10:51,288 INFO L226 Difference]: Without dead ends: 4870 [2023-12-15 18:10:51,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,292 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:51,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 188 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2023-12-15 18:10:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2023-12-15 18:10:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4867 states have (on average 1.5389356893363468) internal successors, (7490), 4867 states have internal predecessors, (7490), 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 18:10:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2023-12-15 18:10:51,433 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2023-12-15 18:10:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:51,433 INFO L495 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2023-12-15 18:10:51,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2023-12-15 18:10:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 18:10:51,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:51,437 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:51,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 18:10:51,437 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:51,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash 894545443, now seen corresponding path program 1 times [2023-12-15 18:10:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:51,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588254814] [2023-12-15 18:10:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:51,453 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 18:10:51,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:51,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588254814] [2023-12-15 18:10:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588254814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:51,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068665122] [2023-12-15 18:10:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:51,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:51,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,455 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:51,523 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2023-12-15 18:10:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 18:10:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:51,531 INFO L225 Difference]: With dead ends: 7304 [2023-12-15 18:10:51,531 INFO L226 Difference]: Without dead ends: 4934 [2023-12-15 18:10:51,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,535 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:51,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2023-12-15 18:10:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2023-12-15 18:10:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4932 states, 4931 states have (on average 1.5189616710606368) internal successors, (7490), 4931 states have internal predecessors, (7490), 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 18:10:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2023-12-15 18:10:51,645 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2023-12-15 18:10:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:51,646 INFO L495 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2023-12-15 18:10:51,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2023-12-15 18:10:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 18:10:51,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:51,650 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:51,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 18:10:51,650 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:51,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash -693802459, now seen corresponding path program 1 times [2023-12-15 18:10:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:51,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742238777] [2023-12-15 18:10:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:51,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:51,666 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 18:10:51,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:51,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742238777] [2023-12-15 18:10:51,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742238777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:51,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:51,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577863690] [2023-12-15 18:10:51,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:51,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:51,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,668 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:51,745 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2023-12-15 18:10:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:51,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 18:10:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:51,758 INFO L225 Difference]: With dead ends: 8712 [2023-12-15 18:10:51,758 INFO L226 Difference]: Without dead ends: 8710 [2023-12-15 18:10:51,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,761 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:51,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2023-12-15 18:10:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2023-12-15 18:10:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 7171 states have (on average 1.4728768651513038) internal successors, (10562), 7171 states have internal predecessors, (10562), 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 18:10:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2023-12-15 18:10:51,900 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2023-12-15 18:10:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:51,900 INFO L495 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2023-12-15 18:10:51,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2023-12-15 18:10:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 18:10:51,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:51,905 INFO L195 NwaCegarLoop]: trace histogram [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 18:10:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 18:10:51,906 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:51,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1714870813, now seen corresponding path program 1 times [2023-12-15 18:10:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973811778] [2023-12-15 18:10:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:51,926 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 18:10:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973811778] [2023-12-15 18:10:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973811778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983751674] [2023-12-15 18:10:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:51,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:51,928 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:52,033 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2023-12-15 18:10:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 18:10:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:52,048 INFO L225 Difference]: With dead ends: 16648 [2023-12-15 18:10:52,048 INFO L226 Difference]: Without dead ends: 9606 [2023-12-15 18:10:52,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:52,059 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:52,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 189 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2023-12-15 18:10:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2023-12-15 18:10:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9604 states, 9603 states have (on average 1.4664167447672602) internal successors, (14082), 9603 states have internal predecessors, (14082), 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 18:10:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2023-12-15 18:10:52,253 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2023-12-15 18:10:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:52,253 INFO L495 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2023-12-15 18:10:52,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2023-12-15 18:10:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 18:10:52,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:52,259 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-12-15 18:10:52,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 18:10:52,259 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:52,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -32824986, now seen corresponding path program 1 times [2023-12-15 18:10:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:52,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517422347] [2023-12-15 18:10:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:52,272 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 18:10:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517422347] [2023-12-15 18:10:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517422347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:52,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845839709] [2023-12-15 18:10:52,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:52,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:52,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:52,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:52,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:52,274 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:52,366 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2023-12-15 18:10:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:52,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-15 18:10:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:52,380 INFO L225 Difference]: With dead ends: 14408 [2023-12-15 18:10:52,381 INFO L226 Difference]: Without dead ends: 9734 [2023-12-15 18:10:52,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:52,389 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:52,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2023-12-15 18:10:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2023-12-15 18:10:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9732 states, 9731 states have (on average 1.44712773610112) internal successors, (14082), 9731 states have internal predecessors, (14082), 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 18:10:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2023-12-15 18:10:52,558 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2023-12-15 18:10:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:52,558 INFO L495 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2023-12-15 18:10:52,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2023-12-15 18:10:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 18:10:52,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:52,563 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-12-15 18:10:52,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 18:10:52,564 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:52,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1621172888, now seen corresponding path program 1 times [2023-12-15 18:10:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263140923] [2023-12-15 18:10:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:52,581 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 18:10:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263140923] [2023-12-15 18:10:52,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263140923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:52,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:52,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896298315] [2023-12-15 18:10:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:52,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:52,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:52,584 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:52,723 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2023-12-15 18:10:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-15 18:10:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:52,800 INFO L225 Difference]: With dead ends: 16904 [2023-12-15 18:10:52,800 INFO L226 Difference]: Without dead ends: 16902 [2023-12-15 18:10:52,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:52,803 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 39 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:52,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2023-12-15 18:10:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2023-12-15 18:10:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14340 states, 14339 states have (on average 1.401631912964642) internal successors, (20098), 14339 states have internal predecessors, (20098), 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 18:10:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2023-12-15 18:10:53,105 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2023-12-15 18:10:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:53,105 INFO L495 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2023-12-15 18:10:53,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2023-12-15 18:10:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 18:10:53,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:53,118 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-12-15 18:10:53,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 18:10:53,118 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:53,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1652726054, now seen corresponding path program 1 times [2023-12-15 18:10:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371014993] [2023-12-15 18:10:53,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:53,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:53,133 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 18:10:53,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:53,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371014993] [2023-12-15 18:10:53,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371014993] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:53,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:53,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:53,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285306048] [2023-12-15 18:10:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:53,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:53,134 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:53,355 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2023-12-15 18:10:53,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-15 18:10:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:53,437 INFO L225 Difference]: With dead ends: 33032 [2023-12-15 18:10:53,437 INFO L226 Difference]: Without dead ends: 18950 [2023-12-15 18:10:53,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:53,444 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:53,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 190 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2023-12-15 18:10:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2023-12-15 18:10:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18948 states, 18947 states have (on average 1.3917770623317676) internal successors, (26370), 18947 states have internal predecessors, (26370), 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 18:10:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2023-12-15 18:10:53,736 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2023-12-15 18:10:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:53,737 INFO L495 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2023-12-15 18:10:53,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 18:10:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2023-12-15 18:10:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 18:10:53,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:53,750 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-12-15 18:10:53,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 18:10:53,750 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:53,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1283463128, now seen corresponding path program 1 times [2023-12-15 18:10:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20645658] [2023-12-15 18:10:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:53,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:53,777 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 18:10:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20645658] [2023-12-15 18:10:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20645658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073164731] [2023-12-15 18:10:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:53,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:53,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:53,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:53,779 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:54,039 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2023-12-15 18:10:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:54,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 18:10:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:54,060 INFO L225 Difference]: With dead ends: 28424 [2023-12-15 18:10:54,060 INFO L226 Difference]: Without dead ends: 19206 [2023-12-15 18:10:54,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:54,070 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:54,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2023-12-15 18:10:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2023-12-15 18:10:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19204 states, 19203 states have (on average 1.3732229339165756) internal successors, (26370), 19203 states have internal predecessors, (26370), 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 18:10:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2023-12-15 18:10:54,412 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2023-12-15 18:10:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:54,412 INFO L495 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2023-12-15 18:10:54,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2023-12-15 18:10:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 18:10:54,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:54,423 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-12-15 18:10:54,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 18:10:54,424 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:54,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash -304884774, now seen corresponding path program 1 times [2023-12-15 18:10:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457135091] [2023-12-15 18:10:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:54,437 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 18:10:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:54,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457135091] [2023-12-15 18:10:54,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457135091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:54,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:54,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:54,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467874220] [2023-12-15 18:10:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:54,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:54,438 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:54,757 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2023-12-15 18:10:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:54,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 18:10:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:54,826 INFO L225 Difference]: With dead ends: 32776 [2023-12-15 18:10:54,826 INFO L226 Difference]: Without dead ends: 32774 [2023-12-15 18:10:54,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:54,840 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:54,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2023-12-15 18:10:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2023-12-15 18:10:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28676 states, 28675 states have (on average 1.3302877070619006) internal successors, (38146), 28675 states have internal predecessors, (38146), 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 18:10:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2023-12-15 18:10:55,459 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2023-12-15 18:10:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:55,459 INFO L495 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2023-12-15 18:10:55,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2023-12-15 18:10:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 18:10:55,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:55,582 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-12-15 18:10:55,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 18:10:55,582 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:55,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1325953128, now seen corresponding path program 1 times [2023-12-15 18:10:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:55,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302377453] [2023-12-15 18:10:55,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:55,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:55,613 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 18:10:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302377453] [2023-12-15 18:10:55,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302377453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:55,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:55,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706236486] [2023-12-15 18:10:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:55,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:55,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:55,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:55,614 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:56,048 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2023-12-15 18:10:56,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:56,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 18:10:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:56,084 INFO L225 Difference]: With dead ends: 65544 [2023-12-15 18:10:56,084 INFO L226 Difference]: Without dead ends: 37382 [2023-12-15 18:10:56,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:56,103 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:56,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 191 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2023-12-15 18:10:56,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2023-12-15 18:10:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37380 states, 37379 states have (on average 1.3150164530886326) internal successors, (49154), 37379 states have internal predecessors, (49154), 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 18:10:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2023-12-15 18:10:56,752 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2023-12-15 18:10:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:56,752 INFO L495 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2023-12-15 18:10:56,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 18:10:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2023-12-15 18:10:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 18:10:56,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:56,779 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-12-15 18:10:56,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-15 18:10:56,779 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:56,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash -861277957, now seen corresponding path program 1 times [2023-12-15 18:10:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386619014] [2023-12-15 18:10:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:56,792 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 18:10:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:56,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386619014] [2023-12-15 18:10:56,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386619014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:56,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:56,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858467096] [2023-12-15 18:10:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:56,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:56,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:56,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:56,794 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:57,306 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2023-12-15 18:10:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-15 18:10:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:57,351 INFO L225 Difference]: With dead ends: 56072 [2023-12-15 18:10:57,351 INFO L226 Difference]: Without dead ends: 37894 [2023-12-15 18:10:57,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:57,368 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:57,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 169 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2023-12-15 18:10:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2023-12-15 18:10:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37892 states, 37891 states have (on average 1.2972473674487346) internal successors, (49154), 37891 states have internal predecessors, (49154), 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 18:10:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2023-12-15 18:10:58,112 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2023-12-15 18:10:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:10:58,112 INFO L495 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2023-12-15 18:10:58,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2023-12-15 18:10:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 18:10:58,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:10:58,147 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-12-15 18:10:58,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-15 18:10:58,147 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:10:58,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:10:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1845341437, now seen corresponding path program 1 times [2023-12-15 18:10:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:10:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805392051] [2023-12-15 18:10:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:10:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:10:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:10:58,160 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 18:10:58,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:10:58,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805392051] [2023-12-15 18:10:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805392051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:10:58,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:10:58,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:10:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743192698] [2023-12-15 18:10:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:10:58,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:10:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:10:58,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:10:58,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:58,162 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:10:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:10:58,982 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2023-12-15 18:10:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:10:58,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-15 18:10:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:10:59,077 INFO L225 Difference]: With dead ends: 110600 [2023-12-15 18:10:59,078 INFO L226 Difference]: Without dead ends: 73734 [2023-12-15 18:10:59,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:10:59,121 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:10:59,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 160 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:10:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2023-12-15 18:11:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2023-12-15 18:11:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73732 states, 73731 states have (on average 1.2499762650716795) internal successors, (92162), 73731 states have internal predecessors, (92162), 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 18:11:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2023-12-15 18:11:00,574 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2023-12-15 18:11:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:00,574 INFO L495 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2023-12-15 18:11:00,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2023-12-15 18:11:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 18:11:00,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:11:00,669 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-12-15 18:11:00,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-15 18:11:00,669 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:11:00,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:11:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1428557505, now seen corresponding path program 1 times [2023-12-15 18:11:00,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:11:00,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426288370] [2023-12-15 18:11:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:11:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:11:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:11:00,680 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 18:11:00,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:11:00,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426288370] [2023-12-15 18:11:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426288370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:11:00,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:11:00,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:11:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943988331] [2023-12-15 18:11:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:11:00,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:11:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:11:00,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:11:00,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:00,681 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:01,793 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2023-12-15 18:11:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:01,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-15 18:11:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:01,876 INFO L225 Difference]: With dead ends: 79880 [2023-12-15 18:11:01,877 INFO L226 Difference]: Without dead ends: 79878 [2023-12-15 18:11:01,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:01,892 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 33 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:01,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2023-12-15 18:11:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2023-12-15 18:11:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73732 states, 73731 states have (on average 1.2360879413001316) internal successors, (91138), 73731 states have internal predecessors, (91138), 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 18:11:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2023-12-15 18:11:03,274 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2023-12-15 18:11:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:03,274 INFO L495 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2023-12-15 18:11:03,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2023-12-15 18:11:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-15 18:11:03,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:11:03,337 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-12-15 18:11:03,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-15 18:11:03,338 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:11:03,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:11:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1371225485, now seen corresponding path program 1 times [2023-12-15 18:11:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:11:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373725363] [2023-12-15 18:11:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:11:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:11:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:11:03,389 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 18:11:03,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:11:03,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373725363] [2023-12-15 18:11:03,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373725363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:11:03,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:11:03,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:11:03,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143800459] [2023-12-15 18:11:03,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:11:03,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:11:03,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:11:03,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:11:03,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:03,391 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:04,984 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2023-12-15 18:11:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:04,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-15 18:11:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:05,108 INFO L225 Difference]: With dead ends: 121864 [2023-12-15 18:11:05,108 INFO L226 Difference]: Without dead ends: 121862 [2023-12-15 18:11:05,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:05,135 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 30 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:05,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2023-12-15 18:11:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2023-12-15 18:11:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113668 states, 113667 states have (on average 1.207192940783165) internal successors, (137218), 113667 states have internal predecessors, (137218), 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 18:11:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2023-12-15 18:11:06,817 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2023-12-15 18:11:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:06,823 INFO L495 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2023-12-15 18:11:06,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2023-12-15 18:11:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-15 18:11:06,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:11:06,902 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-12-15 18:11:06,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-15 18:11:06,916 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:11:06,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:11:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash 350157131, now seen corresponding path program 1 times [2023-12-15 18:11:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:11:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957217219] [2023-12-15 18:11:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:11:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:11:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:11:06,944 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 18:11:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:11:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957217219] [2023-12-15 18:11:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957217219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:11:06,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:11:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:11:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054636365] [2023-12-15 18:11:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:11:06,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:11:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:11:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:11:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:06,946 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:08,895 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2023-12-15 18:11:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:08,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-15 18:11:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:09,053 INFO L225 Difference]: With dead ends: 257032 [2023-12-15 18:11:09,053 INFO L226 Difference]: Without dead ends: 144390 [2023-12-15 18:11:09,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:09,099 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:09,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 193 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2023-12-15 18:11:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2023-12-15 18:11:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144388 states, 144387 states have (on average 1.1772943547549295) internal successors, (169986), 144387 states have internal predecessors, (169986), 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 18:11:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2023-12-15 18:11:11,867 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2023-12-15 18:11:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:11,867 INFO L495 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2023-12-15 18:11:11,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2023-12-15 18:11:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 18:11:11,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:11:11,941 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-12-15 18:11:11,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-15 18:11:11,942 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:11:11,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:11:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash -441466798, now seen corresponding path program 1 times [2023-12-15 18:11:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:11:11,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6790277] [2023-12-15 18:11:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:11:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:11:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:11:11,963 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 18:11:11,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:11:11,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6790277] [2023-12-15 18:11:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6790277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:11:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:11:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:11:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740683454] [2023-12-15 18:11:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:11:11,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:11:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:11:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:11:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:11,965 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:13,803 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2023-12-15 18:11:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:13,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-15 18:11:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:13,997 INFO L225 Difference]: With dead ends: 218120 [2023-12-15 18:11:13,997 INFO L226 Difference]: Without dead ends: 147462 [2023-12-15 18:11:14,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:14,059 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:14,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2023-12-15 18:11:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2023-12-15 18:11:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147460 states, 147459 states have (on average 1.1666564943475815) internal successors, (172034), 147459 states have internal predecessors, (172034), 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 18:11:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2023-12-15 18:11:17,002 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2023-12-15 18:11:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:17,003 INFO L495 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2023-12-15 18:11:17,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2023-12-15 18:11:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 18:11:17,074 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:11:17,074 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-12-15 18:11:17,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-15 18:11:17,074 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:11:17,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:11:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2029814700, now seen corresponding path program 1 times [2023-12-15 18:11:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:11:17,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491970487] [2023-12-15 18:11:17,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:11:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:11:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:11:17,093 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 18:11:17,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:11:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491970487] [2023-12-15 18:11:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491970487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:11:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:11:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:11:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382486731] [2023-12-15 18:11:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:11:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:11:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:11:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:11:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:17,094 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:19,773 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2023-12-15 18:11:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:19,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-15 18:11:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:20,118 INFO L225 Difference]: With dead ends: 237574 [2023-12-15 18:11:20,118 INFO L226 Difference]: Without dead ends: 237572 [2023-12-15 18:11:20,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:20,186 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 26 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:20,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states. [2023-12-15 18:11:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237572 to 229380. [2023-12-15 18:11:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229380 states, 229379 states have (on average 1.1428509148614303) internal successors, (262146), 229379 states have internal predecessors, (262146), 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 18:11:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229380 states to 229380 states and 262146 transitions. [2023-12-15 18:11:24,020 INFO L78 Accepts]: Start accepts. Automaton has 229380 states and 262146 transitions. Word has length 31 [2023-12-15 18:11:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:24,020 INFO L495 AbstractCegarLoop]: Abstraction has 229380 states and 262146 transitions. [2023-12-15 18:11:24,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 229380 states and 262146 transitions. [2023-12-15 18:11:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 18:11:24,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:11:24,151 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-12-15 18:11:24,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-15 18:11:24,152 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:11:24,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:11:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1244084242, now seen corresponding path program 1 times [2023-12-15 18:11:24,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:11:24,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855391533] [2023-12-15 18:11:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:11:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:11:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:11:24,163 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 18:11:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:11:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855391533] [2023-12-15 18:11:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855391533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:11:24,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:11:24,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 18:11:24,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807220816] [2023-12-15 18:11:24,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:11:24,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:11:24,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:11:24,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:11:24,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:24,165 INFO L87 Difference]: Start difference. First operand 229380 states and 262146 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:11:27,785 INFO L93 Difference]: Finished difference Result 512004 states and 577538 transitions. [2023-12-15 18:11:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:11:27,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-15 18:11:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:11:27,786 INFO L225 Difference]: With dead ends: 512004 [2023-12-15 18:11:27,786 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 18:11:27,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 18:11:27,868 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:11:27,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 192 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:11:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 18:11:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 18:11:27,868 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 18:11:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 18:11:27,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2023-12-15 18:11:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:11:27,868 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 18:11:27,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 18:11:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 18:11:27,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 18:11:27,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 18:11:27,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-15 18:11:27,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 18:11:27,889 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2023-12-15 18:11:27,889 INFO L899 garLoopResultBuilder]: For program point L168(line 168) no Hoare annotation was computed. [2023-12-15 18:11:27,889 INFO L899 garLoopResultBuilder]: For program point L152-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,889 INFO L899 garLoopResultBuilder]: For program point L119-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,889 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,889 INFO L899 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2023-12-15 18:11:27,889 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,889 INFO L899 garLoopResultBuilder]: For program point L203(lines 7 207) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L137-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L138(line 138) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L107-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 6 207) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2023-12-15 18:11:27,890 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L902 garLoopResultBuilder]: At program point L197-1(lines 50 202) the Hoare annotation is: true [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L198(line 198) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L99-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,891 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,892 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 85) no Hoare annotation was computed. [2023-12-15 18:11:27,892 INFO L899 garLoopResultBuilder]: For program point L83-2(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,892 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 7 207) no Hoare annotation was computed. [2023-12-15 18:11:27,892 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2023-12-15 18:11:27,892 INFO L899 garLoopResultBuilder]: For program point L167-1(lines 50 202) no Hoare annotation was computed. [2023-12-15 18:11:27,894 INFO L445 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:11:27,895 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 18:11:27,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 06:11:27 BoogieIcfgContainer [2023-12-15 18:11:27,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 18:11:27,901 INFO L158 Benchmark]: Toolchain (without parser) took 39532.55ms. Allocated memory was 201.3MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 138.2MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2023-12-15 18:11:27,901 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 201.3MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 18:11:27,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.76ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 126.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 18:11:27,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.95ms. Allocated memory is still 201.3MB. Free memory was 125.9MB in the beginning and 124.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 18:11:27,901 INFO L158 Benchmark]: Boogie Preprocessor took 24.65ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 18:11:27,901 INFO L158 Benchmark]: RCFGBuilder took 487.75ms. Allocated memory was 201.3MB in the beginning and 295.7MB in the end (delta: 94.4MB). Free memory was 122.0MB in the beginning and 248.5MB in the end (delta: -126.5MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2023-12-15 18:11:27,901 INFO L158 Benchmark]: TraceAbstraction took 38780.01ms. Allocated memory was 295.7MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 248.0MB in the beginning and 4.7GB in the end (delta: -4.4GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2023-12-15 18:11:27,902 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.59ms. Allocated memory is still 201.3MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.76ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 126.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.95ms. Allocated memory is still 201.3MB. Free memory was 125.9MB in the beginning and 124.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.65ms. Allocated memory is still 201.3MB. Free memory was 124.0MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 487.75ms. Allocated memory was 201.3MB in the beginning and 295.7MB in the end (delta: 94.4MB). Free memory was 122.0MB in the beginning and 248.5MB in the end (delta: -126.5MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * TraceAbstraction took 38780.01ms. Allocated memory was 295.7MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 248.0MB in the beginning and 4.7GB in the end (delta: -4.4GB). Peak memory consumption was 3.1GB. 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: 205]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 36, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.8s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1924 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1924 mSDsluCounter, 6255 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2530 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 3725 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229380occurred in iteration=35, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8194 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 1960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 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: 50]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-15 18:11:27,928 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...